Systems, methods, and program products for operating exchange traded products holding digital math-based assets

ABSTRACT

Systems, methods, and program products for providing an exchange traded product holding digital math-based assets are disclosed. Shares based on digital math-based assets may be redeemed using one or more computers by determining share price information based upon quantities of digital math-based assets held by a trust, electronically receiving a request from an authorized participant user device to redeem a quantity of shares, electronically transmitting a quantity of digital math-based assets from one or more origin digital asset accounts to one or more destination digital asset accounts associated with the authorized participant, and canceling the quantity of shares from the authorized participant.

RELATED APPLICATIONS

This application claims priority as a continuation to U.S. patentapplication Ser. No. 14/318,475, filed Jun. 27, 2014 and entitledSYSTEMS, METHODS, AND PROGRAM PRODUCTS FOR OPERATING EXCHANGE TRADEDPRODUCTS HOLDING DIGITAL MATH-BASED ASSETS, which in turn claimspriority as a continuation to U.S. patent application Ser. No.14/318,456, filed Jun. 27, 2014 and entitled SYSTEMS, METHODS, ANDPROGRAM PRODUCTS FOR OPERATING EXCHANGE TRADED PRODUCTS HOLDING DIGITALMATH-BASED ASSETS, which in turn claims priority to U.S. Ser. No.61/989,047, filed on May 6, 2014, U.S. Ser. No. 61/986,685, filed onApr. 30, 2014, U.S. Ser. No. 61/978,724, filed on Apr. 11, 2014, U.S.Ser. No. 61/971,981, filed on Mar. 28, 2014, U.S. Ser. No. 61/955,017,filed on Mar. 18, 2014, U.S. Ser. No. 61/933,428, filed on Jan. 30,2014, U.S. Ser. No. 61/920,534, filed on Dec. 24, 2013, U.S. Ser. No.61/903,245, filed on Nov. 12, 2013, U.S. Ser. No. 61/900,191, filed onNov. 5, 2013, U.S. Ser. No. 61/891,294, filed on Oct. 15, 2013, U.S.Ser. No. 61/857,691, filed on Jul. 23, 2013, U.S. Ser. No. 61/857,141,filed on Jul. 22, 2013, U.S. Ser. No. 61/856,323, filed on Jul. 19,2013, U.S. Ser. No. 61/841,760, filed on Jul. 1, 2013, and U.S. Ser. No.61/841,177, filed on Jun. 28, 2013, and the entire contents of all ofthese application are incorporated herein by reference.

FIELD

In embodiments, the present invention generally relates to systems,methods, and program products for use with exchange traded products(“ETPs”) holding digital assets and other products and/or servicesrelated to ETPs holding digital assets.

SUMMARY

Systems, methods, and program products for use with ETPs holding digitalassets, including digital math-based assets, such as bitcoins,Namecoins, Litecoins, PPCoins, Tonal bitcoins, IxCoins, Devcoins,Freicoins, I0coins, Terracoins, Liquidcoins, BBQcoins, BitBars,PhenixCoins, Ripple, Dogecoins, Mastercoins, BlackCoins, Ether, Nxt,BitShares-PTS, Quark, Primecoin, Feathercoin, Peercoin, Darkcoins, XC,MaidSafeCoins, Vertcoins, Qoras, Zetacoins, Megacoins, YbCoins,Novacoins, Moneros, Infinitecoins, MaxCoins, WorldCoins, Billioncoins,Anoncoins Colored Coins, or Counterparty, to name a few, and otherfinancial products or services based on the same, are disclosed.

In embodiments, a computer-implemented method may comprise the steps of(i) determining, by a trust computer system including one or morecomputers, share price information based at least in part upon a firstquantity of digital math-based assets held by a trust at a first pointin time and a second quantity of shares in the trust at the first pointin time; (ii) receiving, at the trust computer system from one or moreauthorized participant user devices of an authorized participant, anelectronic request to purchase a third quantity of shares; (iii)determining, by the trust computer system, a fourth quantity of digitalmath-based assets based at least in part upon the share priceinformation and the third quantity of shares; (iv) obtaining, using thetrust computer system, one or more destination digital asset accountidentifiers (e.g., one or more digital asset account addresses, and/orone or more digital asset account public keys, to name a few)corresponding to one or more destination digital asset accounts forreceipt of digital math-based assets from the authorized participant;(v) transmitting, from the trust computer system to the one or moreauthorized participant user devices, the one or more destination digitalasset account identifiers and an electronic amount indication of thefourth quantity of digital math-based assets; (vi) receiving, at thetrust computer system, an electronic transfer indication of a transferof digital math-based assets to the destination asset account; (vii)verifying, by the trust computer system using a decentralized electronicledger maintained by a plurality of physically remote computer systems,a receipt of the fourth quantity of digital math-based assets in the oneor more destination digital asset accounts; and (viii) issuing orcausing to be issued, using the trust computer system, the thirdquantity of shares to the authorized participant.

In embodiments, the computer-implemented method may further comprise thestep of, after the determining step (i) above, transmitting, from thetrust computer system to the one or more authorized participant userdevices, the share price information. In embodiments, the determiningstep (i) above may further comprise the steps of determining, by thetrust computer system, a fifth quantity of digital math-based assetsheld by the trust that are attributable to shareholders; determining, bythe trust computer system, a sixth quantity of digital math-based assetsby subtracting from the fifth quantity a seventh quantity of digitalmath-based assets associated with trust expenses; and dividing the sixthquantity by an eighth quantity of outstanding shares.

In embodiments, the verifying step (vii) above may further comprise thesteps of accessing, using the trust computer system, a plurality ofupdates to the decentralized electronic ledger (e.g., new blocks addedto a bitcoin blockchain); analyzing, using the trust computer system,each of the plurality of updates for a first confirmation of the receiptby a node in a network associated with the digital math-based asset; anddetermining, using the trust computer system, a final confirmation ofthe receipt after detecting first confirmations of the receipt in apredetermined number of the plurality of updates to the decentralizedelectronic ledger.

In embodiments, the computer-implemented method may further comprise thestep of transferring, using the trust computer system, the fourthquantity of digital math-based assets into one or more digital assetaccounts associated with a trust custody account.

In embodiments, the computer-implemented method may further comprise thestep of transmitting, from the trust computer system to the one or moreauthorized participant user devices, an electronic receiptacknowledgement indicating the receipt of the fourth quantity of digitalmath-based assets.

In embodiments, the computer-implemented method may further comprise thestep of transmitting or causing to be transmitted, to the one or moreauthorized participant user devices, an electronic share issuanceindication of the issuing of the third quantity of shares.

In embodiments, the share price information may be a quantity of digitalmath-based assets per share and/or per a basket of shares correspondingto a number of shares associated with one creation unit of shares. Inembodiments, the basket of shares may comprise one or more quantities ofshares selected from the group consisting of: 5,000 shares, 10,000shares, 15,000 shares, 25,000 shares, 50,000 shares, and 100,000 shares.

In embodiments, the electronic transfer indication may further comprisean identification of one or more origin digital asset accounts.

In embodiments, the trust computer system may be operated by a trusteeof the trust and/or an administrator of the trust on behalf of thetrust.

In embodiments, a computer-implemented method may comprise the steps of(i) determining, by a trust computer system comprising one or morecomputers, share price information based at least in part upon a firstquantity of digital math-based assets held by a trust at a first pointin time and a second quantity of shares in the trust at the first pointin time; (ii) receiving, at the trust computer system from the one ormore authorized participant user devices of the authorized participant,an electronic request to redeem a third quantity of shares; (iii)determining, by the trust computer system, a fourth quantity of digitalmath-based assets based at least in part upon the share priceinformation and the third quantity of shares; (iv) obtaining, by thetrust computer system, one or more destination digital asset accountidentifiers corresponding to one or more destination digital assetaccounts for receipt by the authorized participant of a transfer of thefourth quantity of digital math-based assets from the trust; (v)obtaining, using the trust computer system, one or more origin digitalasset account identifiers corresponding to one or more origin digitalasset accounts for the transfer; (vi) initiating, using the trustcomputer system, the transfer of the fourth quantity of digitalmath-based assets from the one or more origin digital asset accounts tothe one or more destination digital asset accounts; (vii) broadcasting,using the trust computer system, the transfer to a decentralizedelectronic ledger maintained by a plurality of physically remotecomputer systems; (viii) verifying, by the trust computer system usingthe decentralized electronic ledger, a receipt of the fourth quantity ofdigital math-based assets at the one or more destination digital assetaccounts; and (ix) canceling or causing to be canceled, using the trustcomputer system, the third quantity of shares from the authorizedparticipant.

In embodiments, the computer-implemented method may further comprise thestep of transmitting, from the trust computer system to the one or moreauthorized participant user devices, the share price information.

In embodiments, the computer-implemented method may further comprise thesteps of obtaining, using the trust computer system, a net asset valueper share; determining, using the trust computer system, a digitalmath-based asset value of the third quantity of shares based upon thenet asset value per share; determining, using the trust computer system,transaction fees associated with the electronic request; anddetermining, using the trust computer system, the fourth quantity ofdigital math-based assets by subtracting the transaction fees from thedigital math-based asset value of the third quantity of shares.

In embodiments, the computer-implemented method may further comprise thestep of determining, by the trust computer system, a settlement periodassociated with the electronic request.

In embodiments, the computer-implemented method may further comprise thestep of retrieving or causing to be retrieved, using the trust computersystem, one or more private keys associated with the one or more origindigital asset accounts; and accessing the one or more origin digitalasset accounts using at least the one or more private keys.

In embodiments, the computer-implemented method may further comprise thesteps of issuing, using the trust computer system, retrievalinstructions for retrieving a plurality of encrypted private keyscorresponding to the one or more origin digital asset accounts;receiving, at the trust computer system, the plurality of encryptedprivate keys; and obtaining, using the trust computer system, one ormore private keys by decrypting the plurality of private keys.

In embodiments, the computer-implemented method may further comprise thesteps of issuing, using the trust computer system, retrievalinstructions for retrieving a plurality of private key segmentscorresponding to the one or more origin digital asset accounts;receiving, at the trust computer system, the plurality of private keysegments; and obtaining, using the trust computer system, one or moreprivate keys by assembling the plurality of private keys.

In embodiments, the computer-implemented method may further comprise thesteps of issuing, using the trust computer system, retrievalinstructions for retrieving a plurality of encrypted private keysegments corresponding to the one or more origin digital asset accounts;receiving, at the trust computer system, the plurality of encryptedprivate key segments; and obtaining, using the trust computer system,one or more private keys by decrypting the plurality of private keysegments and assembling the segments into one or more private keys.

In embodiments, the computer-implemented method may further comprise thesteps of issuing, using the trust computer system, retrievalinstructions for retrieving a plurality of encrypted private keysegments corresponding to the one or more origin digital asset accounts;receiving, at the trust computer system, the plurality of encryptedprivate key segments; obtaining, using the trust computer system, one ormore first private keys by decrypting the plurality of private keysegments and assembling the segments into one or more first privatekeys; and obtaining, using the trust computer system, at least onesecond private key corresponding to the one or more origin digital assetaccounts. In embodiments, the one or more first private keys and the atleast one second private key may be keys for one or more multi-signaturedigital asset accounts.

In embodiments, the computer-implemented method may further comprise thesteps of accessing, using the trust computer system, a plurality ofupdates to the decentralized electronic ledger (e.g., new blocks addedto a bitcoin blockchain); analyzing, using the trust computer system,each of the plurality of updates for a first confirmation of the receiptby a node in a network associated with the digital math-based asset; anddetermining, using the trust computer system, a final confirmation ofthe receipt after detecting first confirmations of the receipt in apredetermined number of the plurality of updates to the decentralizedelectronic ledger.

In embodiments, the transaction fees may be denominated in a unit of thedigital math-based asset. In embodiments, the share price informationmay comprise a net asset value per share, an adjusted net asset valueper share, and/or a net asset value per a basket of shares correspondingto a number of shares associated with one creation unit of shares.

In embodiments, the basket of shares may comprise one or more quantitiesof shares selected from the group consisting of: 5,000 shares, 10,000shares, 15,000 shares, 25,000 shares, 50,000 shares, and 100,000 shares.

In embodiments, the electronic request may comprise a redemption order.

In embodiments, the trust computer system may be operated by a trusteeof the trust and/or an administrator of the trust on behalf of thetrust.

In embodiments, the one or more origin digital asset accounts maycorrespond to a trust custody account.

In embodiments, the one or more destination digital asset accounts maycorrespond to an authorized participant custody account.

In embodiments, a computer-implemented method may comprise the steps of(i) generating, using a computer system comprising one or morecomputers, one or more digital asset accounts capable of holding one ormore digital math-based assets; (ii) obtaining, using the computersystem, one or more private keys corresponding to the one or moredigital asset accounts; (iii) dividing, using the computer system, eachof the one or more private keys into a plurality of private keysegments; (iv) encrypting, using the computer system, each of theplurality of private key segments; (v) associating, using the computersystem, each of the plurality of private key segments with a respectivereference identifier; (vi) creating, using the computer system, one ormore cards for each of the encrypted plurality of private key segmentswherein each of the one or more cards has fixed thereon one of theencrypted plurality of private key segments along with the respectiveassociated reference identifier; and (vii) tracking, using the computersystem, storage of each of the one or more cards in one or more vaults.

In embodiments, the computer-implemented method may further comprise thesteps of generating, using the computer system, electronic transferinstructions for an electronic transfer of the quantity of digitalmath-based assets to the one or more digital asset accounts; andbroadcasting, using the computer system, the electronic transferinstructions to a decentralized electronic ledger maintained by aplurality of physically remote computer systems.

In embodiments, the computer system includes at least one isolatedcomputer that is not directly connected to an external data network.

In embodiments, the encryption step (iv) above, may further compriseimplementing, using the computer system, a symmetric-key and/orasymmetric-key encryption algorithm.

In embodiments, the one or more cards may be plastic, a paper product,index cards, sheets of paper, metal, and/or laminated.

In embodiments, each of the encrypted plurality of private key segmentsalong with the respective associated reference identifier may be fixedon the one or more cards via printing, etching. In embodiments, each ofthe encrypted plurality of private key segments may be fixed on the oneor more cards via a magnetic encoding and/or scannable code. Inembodiments, the scannable code may be a bar code and/or a QR code.

In embodiments, the one or more vaults may be geographically remote fromeach other. In embodiments, the one or more vaults may include a bankvault and/or a precious metal vault. In embodiments, the one or morevaults may comprise a main set of vaults and one or more sets of backupvaults. In embodiments, the main set of vaults may be located in ageographically proximate area and at least one of the one or more setsof backup vaults are located in a geographically remote area. Inembodiments, the geographically proximate area may be a metropolitanarea of a first city.

In embodiments, each of the plurality of private key segmentscorresponding to a first private key may be stored in separate vaults.

In embodiments, the computer-implemented method may further comprise thesteps of receiving, at the computer system, a quantity of digitalmath-based assets; and storing, using the computer system, the quantityof digital math-based assets in the one or more digital asset accounts.

In embodiments, a computer-implemented method may comprise the steps of(i) generating, using a computer system comprising one or morecomputers, one or more digital asset accounts capable of holding one ormore digital math-based assets; (ii) obtaining, using the computersystem, a first plurality of private keys corresponding to each of theone or more digital asset accounts; (iii) dividing, using the computersystem, a first private key of the first plurality of private keys intoa second plurality of first private key segments; (iv) encrypting, usingthe computer system, each of the second plurality of first private keysegments; (v) associating, using the computer system, each of the secondplurality of first private key segments and a second private key with arespective reference identifier; (vi) creating, using the computersystem, one or more cards for each of the encrypted second plurality offirst private key segments wherein each of the one or more cards hasfixed thereon one of the encrypted second plurality of first private keysegments along with the respective associated reference identifier; and(vii) tracking, using the computer system, storage of each of the one ormore cards in one or more vaults and storage of the second private key.

In embodiments, the computer-implemented method may further comprise thestep of encrypting, using the computer system, the second private key.

In embodiments, the computer-implemented method may further comprise thestep of electronically storing the second private key on acomputer-readable substrate.

In embodiments, the computer-implemented method may further comprise thesteps of generating, using a computer system comprising one or morecomputers, one or more digital asset accounts capable of holding one ormore digital math-based assets; obtaining, using the computer system,one or more private keys corresponding to the one or more digital assetaccounts; encrypting, using the computer system, each of the one or moreprivate keys; dividing, using the computer system, each of the one ormore encrypted private keys into a plurality of private key segments;associating, using the computer system, each of the plurality of privatekey segments with a respective reference identifier; creating, using thecomputer system, one or more cards for each of the plurality of privatekey segments wherein each of the one or more cards has fixed thereon oneof the plurality of private key segments along with the respectiveassociated reference identifier; and tracking, using the computersystem, storage of each of the one or more cards in one or more vaults.

In embodiments, the one or more digital asset accounts may comprisemulti-signature digital asset accounts.

In embodiments, a computer-implemented method may comprise the steps of(i) determining, using a computer system comprising one or morecomputers, one or more digital asset account identifiers correspondingto one or more digital asset accounts capable of holding one or moredigital math-based assets; (ii) accessing, using the computer system,key storage information associated with each of the one or more digitalasset account identifiers; (iii) determining, using the computer system,based upon the key storage information, storage locations correspondingto each of a plurality of private key segments corresponding to each ofthe one or more digital asset accounts; (iv) issuing or causing to beissued, retrieval instructions for retrieving each of the plurality ofprivate key segments; (v) receiving, at the computer system, each of theplurality of private key segments; (vi) decrypting, using the computersystem, each of the plurality of private key segments; (vii) assembling,using the computer system, each of the plurality of private key segmentsinto one or more private keys.

In embodiments, the computer-implemented method may further comprise thestep of accessing, using the computer system, the one or more digitalasset accounts associated with the one or more private keys.

In embodiments, the computer-implemented method may further comprise thesteps of accessing, using an isolated computer of the computer system,wherein the isolated computer is not directly connected to an externaldata network, the one or more digital asset accounts associated with theone or more private keys; generating, using the isolated computer,transaction instructions comprising one or more transfers from the oneor more digital asset accounts; transferring the transactioninstructions to a networked computer of the computer system; andbroadcasting, using the networked computer, the transaction instructionsto a decentralized electronic ledger maintained by a plurality ofphysically remote computer systems.

In embodiments, the key storage information may comprise a referenceidentifier associated with one or more stored private key segments.

In embodiments, a system may comprise (i) one or more networkedcomputers comprising one or more processors and computer-readablememory; (ii) one or more isolated computers comprising one or moreprocessors and computer-readable memory and configured to generatedigital asset accounts and generate transaction instructions for digitalmath-based asset transactions; (iii) a writing device configured towrite digital asset account keys; and (iv) a reading device configuredto read digital asset account keys.

In embodiments, the system may further comprise an accounting computercomprising one or more processors and computer-readable memory andconfigured to track digital math-based asset transactions involving oneor more specified digital asset accounts.

In embodiments, the one or more isolated computers, the writing device,and the reading device may be located within a Faraday cage.

In embodiments, the isolated computer may not be physically connected toan external data network.

In embodiments, the writing device may be a printer and/or an engraver.

In embodiments, the reading device may be a disk drive, an electroniccard reader. a QR reader, and/or a scanner. In embodiments, the scannermay be a bar code scanner.

In embodiments, the writing and/or device may be operationally connectedto the one or more isolated computers.

In embodiments, a secure system for storing digital math-based assetsmay comprise (a) an electronic isolation chamber; (b) one or moreisolated computers within the electronic isolation chamber andcomprising one or more processors and computer-readable memoryoperatively connected to the one or more processors and having storedthereon instructions for carrying out the steps of (i) generating, usingthe one or more isolated computers, one or more digital asset accountscapable of holding one or more digital math-based assets; (ii)obtaining, using the one or more isolated computers, one or more privatekeys corresponding to the one or more digital asset accounts; (iii)dividing, using the one or more isolated computers, at least one of theone or more private keys for each digital asset account into a pluralityof private key segments, wherein each private key segment will bestored; (iv) associating, using the one or more isolated computers, eachof the plurality of private key segments with a respective referenceidentifier; and (v) transmitting, from the one or more isolatedcomputers to one or more writing devices operatively connected to theone or more isolated computers, electronic writing instructions forwriting a plurality of cards, collated into a plurality of sets havingonly one private key segment per digital asset account, and each cardcontaining one of the plurality of private key segments along with therespective associated reference identifier; (c) the one or more writingdevices located within the electronic isolation chamber and configuredto perform the electronic writing instructions, including collating theplurality of cards into the plurality of sets; and (d) one or morereading devices located within the electronic isolation chamber andconfigured to read the plurality of private key segments along with therespective associated reference identifier from the one or more cards.

In embodiments, a computer-implemented method may comprise the steps of(i) receiving, at a computer system comprising one or more computers, anelectronic request to transfer first respective quantities of digitalmath-based assets from each of a first plurality of digital assetaccounts; (ii) accessing, using the computer system, each of the firstplurality of digital asset accounts; (iii) generating, using thecomputer system, transaction instructions comprising one or moretransfers of the first respective quantities from each of the firstplurality of digital asset accounts; and (iv) broadcasting, using thecomputer system, the transaction instructions to a decentralizedelectronic ledger maintained by a plurality of physically remotecomputer systems.

In embodiments, the first respective quantities of digital math-basedassets comprise different quantities for different digital assetaccounts.

BRIEF DESCRIPTION OF THE DRAWINGS

Exemplary embodiments of the present invention will be described withreferences to the accompanying figures, wherein:

FIG. 1 is a schematic diagram of a digital asset network in accordancewith exemplary embodiments of the present invention;

FIG. 2 is an exemplary screen shot of an excerpt of an exemplary bitcointransaction log showing addresses in accordance with exemplaryembodiments of the present invention;

FIG. 3 is an exemplary exchange agent interface in accordance withexemplary embodiments of the present invention;

FIGS. 4A-4D are exemplary block diagrams of components of securitysystems for an ETP holding digital math-based assets in accordance withvarious exemplary embodiments of the present invention;

FIGS. 5A and 5B are flow charts of exemplary processes for creating andsecuring digital wallets in accordance with exemplary embodiments of thepresent invention;

FIGS. 6A-6C are flow charts of exemplary processes for generatingdigital asset accounts and securely storing the keys corresponding toeach account in accordance with exemplary embodiments of the presentinvention;

FIG. 7 is a flow chart of an exemplary process for retrieving securelystored keys associated with a digital asset account in accordance withexemplary embodiments of the present invention;

FIG. 8 is a flow chart of a method of performing a secure transaction inaccordance with exemplary embodiments of the present invention;

FIGS. 9A-9D are schematic diagrams of cold storage vault systems inaccordance with exemplary embodiments of the present invention;

FIGS. 10A and 10B are schematic diagrams of vault arrangements for adigital asset network in accordance with exemplary embodiments of thepresent invention;

FIGS. 11A-11B are flow charts of processes for generating key storageand insurance in accordance with exemplary embodiments of the presentinvention;

FIGS. 12A-12C are flow charts of processes for recovering key segmentsin accordance with exemplary embodiments of the present invention;

FIG. 13 is a schematic diagram of the participants in an ETP holdingdigital math-based assets in accordance with exemplary embodiments ofthe present invention;

FIG. 14 is a schematic diagram of an exemplary secondary market forshares in the trust in accordance with exemplary embodiments of thepresent invention;

FIGS. 15A and 15B are schematic diagrams of the accounts associated witha trust in accordance with exemplary embodiments of the presentinvention;

FIG. 16 is a block diagram of the data and modules in an exemplaryembodiment of a trust computer system in accordance with the presentinvention;

FIGS. 17A and 17B are flow charts of processes for investing in thetrust in accordance with exemplary embodiments of the present invention;

FIGS. 18A and 18B are flow charts of various exemplary processes forassigning digital math-based assets, such as bitcoins, obtained during acreation and distributing them among digital wallets in accordance withembodiments of the present invention;

FIGS. 19A and 19B are flow charts of processes for redeeming shares inthe trust in accordance with exemplary embodiments of the presentinvention;

FIG. 19C is a flow chart of an exemplary process for redemption ofshares in an exchange traded product holding digital math-based assetsin accordance with exemplary embodiments of the present invention;

FIG. 20A is a flow chart of processes for calculating the NAV value ofshares in a trust holding digital assets in accordance with embodimentsof the present invention;

FIG. 20B is a flow chart of processes for calculating the NAV value ofshares in a trust holding bitcoins in accordance with embodiments of thepresent invention;

FIG. 21A is a flow chart of additional processes associated withevaluation day for calculating NAV value of shares in a trust holdingdigital assets in accordance with embodiments of the present invention;

FIG. 21B is a flow chart of additional processes associated withevaluation day for calculating NAV value of shares in a trust holdingbitcoins in accordance with embodiments of the present invention;

FIG. 22 is a flow chart of a process for determining qualified exchangesin accordance with exemplary embodiments of the present invention;

FIGS. 23A-23H are flow charts showing methods for calculating a blendeddigital asset price in accordance with exemplary embodiments of thepresent invention;

FIG. 24 is a schematic diagram of participants in a system for providinga digital asset index and a digital asset exchange in accordance withexemplary embodiments of the present invention; and

FIGS. 25A and 25B are flow charts of a method for creating an index ofdigital asset prices in accordance with exemplary embodiments of thepresent invention.

DETAILED DESCRIPTION

In embodiments, the present invention generally relates to systems,methods, and program products for use with ETPs holding digital assets,including digital math-based assets, such as bitcoins, Namecoins,Litecoins, PPCoins, Tonal bitcoins, IxCoins, Devcoins, Freicoins,I0coins, Terracoins, Liquidcoins, BBQcoins, BitBars, PhenixCoins,Ripple, Dogecoins, Mastercoins, BlackCoins, Ether, Nxt, BitShares-PTS,Quark, Primecoin, Feathercoin, Peercoin, Darkcoins, XC, MaidSafeCoins,Vertcoins, Qoras, Zetacoins, Megacoins, YbCoins, Novacoins, Moneros,Infinitecoins, MaxCoins, WorldCoins, Billioncoins, Anoncoins ColoredCoins, or Counterparty, to name a few. For purposes of discussion,without limiting the scope of the invention, embodiments involvingbitcoins may be discussed to illustrate the present invention. Thedisclosure can encompass other forms of digital assets, digitalmath-based assets, peer-to-peer electronic cash system, digitalcurrency, synthetic currency, or digital crypto-currency.

In embodiments, the present invention may be used in connection withother products or services related to ETPs, which can include digitalasset price calculators, digital asset indices, digital asset accountmonitoring systems, correlation of news events to digital asset prices,exchanges for converting from, to, or between digital assets, such asdigital math-based assets, automated notification, transaction, and/orarbitrage systems involving digital assets, including digital math-basedassets, kiosk systems for transacting or interacting with digitalmath-based assets, digital asset insurance systems, digital asset securestorage systems, and/or other financial products based on the same.

Digital Math-Based Assets and Bitcoins

A digital math-based asset is a kind of digital asset based upon acomputer generated mathematical and/or cryptographic protocol that may,among other things, be exchanged for value and/or be used to buy andsell goods or pay for services. A digital math-based asset may be anon-tangible asset that is not based upon a governmental rule, law,regulation, and/or backing. The Bitcoin system represents one form ofdigital math-based asset. A bitcoin may be a unit of the Bitcoin digitalmath-based asset. Other examples of digital math-based assets includeNamecoins, Litecoins, PPCoins, Tonal bitcoins, IxCoins, Devcoins,Freicoins, I0coins, Terracoins, Liquidcoins, BBQcoins, BitBars,PhenixCoins, Ripple, Dogecoins, Mastercoins, BlackCoins, Ether, Nxt,BitShares-PTS, Quark, Primecoin, Feathercoin, Peercoin, Darkcoins, XC,MaidSafeCoins, Vertcoins, Qoras, Zetacoins, Megacoins, YbCoins,Novacoins, Moneros, Infinitecoins, MaxCoins, WorldCoins, Billioncoins,Anoncoins Colored Coins, and Counterparty, to name a few. Inembodiments, digital math-based assets, such as bitcoins, may beaccepted in trade by merchants, other businesses, and/or individuals inmany parts of the world.

In embodiments, a digital math-based asset may be based on an opensource mathematical and/or cryptographic protocol, which may exist on adigital asset network, such as a Bitcoin network. The network may becentralized, e.g., run by one or more central servers, or decentralized,e.g., run through a peer-to-peer network. Digital math-based assets maybe maintained, tracked, and/or administered by the network.

A digital math-based asset system may use a decentralized electronicledger system, which may be maintained by a plurality of physicallyremote computer systems. Such a ledger may be a public transaction,which may track asset ownership and/or transactions in a digitalmath-based asset system. The ledger may be a decentralized publictransaction ledger, which can be distributed to users in the network,e.g., via a peer-to-peer sharing. Ledger updates may be broadcast to theusers across the network. Each user may maintain an electronic copy ofall or part of the ledger, as described herein. In embodiments, adigital asset system may employ a ledger that tracks transactions (e.g.,transfers of assets from one address to another) without identifying theassets themselves.

In embodiments, a digital asset ledger, such as the Bitcoin blockchain,can be used to achieve consensus and to solve double-spending problemswhere users attempt to spend the same digital assets in more than onetransaction. In embodiments, before a transaction may be cleared, thetransaction participants may need to wait for some period of time, e.g.,a six-confirmation wait (typically one hour in the context of theBitcoin network, 15 minutes in the context of the Litecoin network, toname a few), before feeling confident that the transaction is valid,e.g., not a double count. Each update to the decentralized electronicledger (e.g., each addition of a block to the Bitcoin blockchain)following execution of a transaction may provide a transactionconfirmation. After a plurality of updates to the ledger, e.g., 6updates, the transaction may be confirmed with certainty or highcertainty.

In embodiments, a blockchain can be a public transaction ledger of thedigital math-based asset network, such as the Bitcoin network. Forexample, one or more computer systems (e.g., miners) or pools ofcomputer systems (e.g., mining pools) can solve algorithmic equationsallowing them to add records of recent transactions (e.g., blocks), to achain of transactions. In embodiments, miners or pools of miners mayperform such services in exchange for some consideration such as anupfront fee (e.g., a set amount of math-based assets) and/or a paymentof transaction fees (e.g., a fixed amount or set percentage of thetransaction) from users whose transactions are recorded in the blockbeing added.

The digital asset network (e.g., Bitcoin network) may timestamptransactions by including them in blocks that form an ongoing chaincalled a blockchain. In embodiments, the addition of a block may occurperiodically, e.g., approximately every 2.5 minutes or every 10 minutes,to name a few. Such blocks cannot be changed without redoing the workthat was required to create each block since the modified block. Thelongest blockchain may serve not only as proof of the sequence of eventsbut also records that this sequence of events was verified by a majorityof the digital asset network's computing power. The blockchainrecognized by the nodes corresponding to the majority of computing powerwill become the accepted blockchain for the network. In embodiments,confirmation of a transaction may be attained with a high degree ofaccuracy following the addition of six blocks to the blockchain after atransaction was performed. As long as a majority of computing power iscontrolled by nodes that are not cooperating to attack the network, theywill generate the longest blockchain of records and outpace attackers.

In embodiments, transaction messages can be broadcast on a best effortbasis, and nodes can leave and rejoin the network at will. Uponreconnection, a node can download and verify new blocks from other nodesto complete its local copy of the blockchain.

In the exemplary Bitcoin system, a bitcoin is defined by a chain ofdigitally-signed transactions that began with its creation as a blockreward through bitcoin mining. Each owner transfers bitcoins to the nextby digitally signing them over to the next owner in a bitcointransaction. A payee can then verify each previous transaction, e.g., byanalyzing the blockchain, to verify the chain of ownership.

FIG. 2 is an exemplary screen shot of an excerpt of a bitcointransaction log or transaction ledger 115 showing digital asset accountidentifiers (e.g., addresses) corresponding to origin and destinationaccounts for each transaction and amount information for eachtransaction. The exemplary log 115 includes transaction identifiers,date and/or time information, fee information, digital asset accountidentifiers for the origin accounts, digital asset account identifiersfor the destination accounts, and amounts transferred to and from eachaccount. Such a ledger may also include description information (such asnotes describing a transaction, e.g. “rent payment”) and/or balanceinformation. Other forms of transaction logs can be used consistent withthe present invention.

An exemplary embodiment of a digital asset network is illustrated inFIG. 1. In embodiments, other digital math-based assets can bemaintained and/or administered by other digital math-based assetnetworks. Without meaning to limit the invention, a digital math-basedasset network will be discussed with reference to a Bitcoin network byexample. A digital math-based asset network, such as a Bitcoin network,may be an online, end-user to end-user network hosting a publictransaction ledger 115 and governed by source code 120 comprisingcryptologic and/or algorithmic protocols. A digital asset network cancomprise a plurality of end users, a . . . N, each of which may accessthe network using one or more corresponding user device 105 a, 105 b, .. . 105N. In embodiments, user devices 105 may be operatively connectedto each other through a data network 125, such as the Internet, a widearea network, a local area network, a telephone network, dedicatedaccess lines, a proprietary network, a satellite network, a wirelessnetwork, a mesh network, or through some other form of end-user toend-user interconnection, which may transmit data and/or otherinformation. Any participants in a digital asset network may beconnected directly or indirectly, as through the data network 125,through wired, wireless, or other connections.

In the exemplary embodiment, each user device 105 can run a digitalasset client 110, e.g., a Bitcoin client, which can comprise digitalasset source code 120 and an electronic transaction ledger 115. Thesource code 120 can be stored in processor readable memory, which may beaccessed by and/or run on one or more processors. The electronictransaction ledger 115 can be stored on the same and/or differentprocessor readable memory, which may be accessible by the one or moreprocessors when running the source code 120. In embodiments, theelectronic transaction ledger 115 a (contained on a user device 105 a)should correspond with the electronic transaction ledgers 115 b . . .115N (contained on user devices 105 b . . . 105N), to the extent thatthe corresponding user device has accessed the Internet and been updated(e.g., downloaded the latest transactions). Accordingly, the electronictransaction ledger may be a public ledger. Exemplary embodiments ofdigital asset clients 110 for the Bitcoin network (Bitcoin clients)include Bitcoin-Qt and Bitcoin Wallet, to name a few.

In addition, a digital asset network, such as a Bitcoin network, mayinclude one or more digital asset exchange 130, such as Bitcoinexchanges (e.g., BitFinex, BTC-e). Digital asset exchanges may enable orotherwise facilitate the transfer of digital assets, such as bitcoins,and/or conversions involving digital assets, such as between differentdigital assets and/or between a digital asset and non-digital assets,currencies, to name a few. The digital asset network may also includeone or more digital asset exchange agents 135, e.g., a Bitcoin exchangeagent. Exchange agents 135 may facilitate and/or accelerate the servicesprovided by the exchanges. Exchanges 130, transmitters 132, and/orexchange agents 135 may interface with financial institutions (e.g.,banks) and/or digital asset users. Transmitters 132 can include, e.g.,money service businesses, which could be licensed in appropriategeographic locations to handle financial transactions. In embodiments,transmitters 132 may be part of and/or associated with a digital assetexchange 130. Like the user devices 105, digital asset exchanges 130,transmitters 132, and exchange agents 135 may be connected to the datanetwork 125 through wired, wireless, or other connections. They may beconnected directly and/or indirectly to each other and/or to one or moreuser device 105 or other entity participating in the digital assetsystem.

Digital assets may be sub-divided into smaller units or bundled intoblocks or baskets. For example, for bitcoins, subunits, such as aSatoshi, as discussed herein, or larger units, such as blocks ofbitcoins, may be used in exemplary embodiments. Each digital asset,e.g., bitcoin, may be subdivided, such as down to eight decimal places,forming 100 million smaller units. For at least bitcoins, such a smallerunit may be called a Satoshi. Other forms of division can be madeconsistent with embodiments of the present invention.

In embodiments, the creation and transfer of digital math-based assetscan be based on an open source mathematical and/or cryptographicprotocol, which may not be managed by any central authority. Digitalassets can be transferred between one or more users or between digitalasset accounts and/or storage devices (e.g., digital wallets) associatedwith a single user, through a network, such as the Internet, via acomputer, smartphone, or other electronic device without an intermediatefinancial institution. In embodiments, a single digital assettransaction can include amounts from multiple origin accountstransferred to multiple destination accounts. Accordingly, a transactionmay comprise one or more input amounts from one or more origin digitalasset accounts and one or more output amounts to one or more destinationaccounts. Origin and destination may be merely labels for identifyingthe role a digital asset account plays in a given transaction; originand destination accounts may be the same type of digital asset account.

In embodiments, a digital math-based asset system may produce digitalasset transaction change. Transaction change refers to leftover digitalasset amounts from transactions in digital asset systems, such asBitcoin, where the transactions are comprised of one or more digitalinputs and outputs. A digital asset account can store and/or trackunspent transaction outputs, which it can use as digital inputs forfuture transactions. In embodiments, a wallet, third-party system,and/or digital asset network may store an electronic log of digitaloutputs to track the outputs associated with the assets contained ineach account. In digital asset systems such as Bitcoin, digital inputsand outputs cannot be subdivided. For example, if a first digital assetaccount is initially empty and receives a transaction output of 20 BTC(a bitcoin unit) from a second digital asset account, the first accountthen stores that 20 BTC output for future use as a transaction input. Tosend 15 BTC, the first account must use the entire 20 BTC as an input,15 BTC of which will be a spent output that is sent to the desireddestination and 5 BTC of which will be an unspent output, which istransaction change that returns to the first account. An account withdigital assets stored as multiple digital outputs can select anycombination of those outputs for use as digital inputs in a spendingtransaction. In embodiments, a digital wallet may programmaticallyselect outputs to use as inputs for a given transaction to minimizetransaction change, such as by combining outputs that produce an amountclosest to the required transaction amount and at least equal to thetransaction amount.

Referring again to FIG. 1, a digital asset network may include digitalasset miners 145. Digital asset miners 145 may perform operationsassociated with generating or minting new digital assets, and/oroperations associated with confirming transactions, to name a few.Digital asset miners 145 may collaborate in one or more digital assetmining pools 150, which may aggregate power (e.g., computer processingpower) so as to increase output, increase control, increase likelihoodof minting new digital assets, increase likelihood of adding blocks to ablockchain, to name a few.

In embodiments, the processing of digital asset transactions, e.g.,bitcoin transactions, can be performed by one or more computers over adistributed network, such as digital asset miners 145, e.g., bitcoinminers, and/or digital asset mining pools 150, e.g., bitcoin miningpools. In embodiments, mining pools 150 may comprise one or more miners145, which miners 145 may work together toward a common goal. Miners 145may have source code 120′, which may govern the activities of the miners145. In embodiments, source code 120′ may be the same source code asfound on user devices 105. These computers and/or servers cancommunicate over a network, such as an internet-based network, and canconfirm transactions by adding them to a ledger 115, which can beupdated and archived periodically using peer-to-peer file sharingtechnology. For example, a new ledger block could be distributed on aperiodic basis, such as approximately every 10 minutes. In embodiments,the ledger may be a blockchain. Each successive block may recordtransactions that have occurred on the digital asset network. Inembodiments, all digital asset transactions may be recorded asindividual blocks in the blockchain. Each block may contain the detailsof some or all of the most recent transactions that are not memorializedin prior blocks. Blocks may also contain a record of the award ofdigital assets, e.g., bitcoins, to the miner 145 or mining pool 150 whoadded the new block, e.g., by solving calculations first.

A miner 145 may have a calculator 155, which may solve equations and/oradd blocks to the blockchain. The calculator 155 may be one or morecomputing devices, software, or special-purpose device, to name a few.In embodiments, in order to add blocks to the blockchain, a miner 145may be required to map an input data set (e.g., the blockchain, plus ablock of the most recent transactions on the digital asset network,e.g., transactions on the Bitcoin network, and an arbitrary number, suchas a nonce) to a desired output data set of predetermined length, suchas a hash value. In embodiments, mapping may be required to use one ormore particular cryptographic algorithms, such as the SHA-256cryptographic hash algorithm or scrypt, to name a few. In embodiments,to solve or calculate a block, a miner 145 may be required to repeatthis computation with a different nonce until the miner 145 generates aSHA-256 hash of a block's header that has a value less than or equal toa current target set by the digital asset network. In embodiments, eachunique block may only be solved and added to the blockchain by one miner145. In such an embodiment, all individual miners 145 and mining pools150 on the digital asset network may be engaged in a competitive processand may seek to increase their computing power to improve theirlikelihood of solving for new blocks. In embodiments, successful digitalasset miners 145 or mining pools 150 may receive an incentive, such as,e.g., a fixed number of digital assets (e.g., bitcoins) and/or atransaction fee for performing the calculation first and correctlyand/or in a verifiable manner.

In embodiments, the cryptographic hash function that a miner 145 usesmay be one-way only and thus may be, in effect, irreversible. Inembodiments, hash values may be easy to generate from input data, suchas valid recent network transaction(s), blockchain, and/or nonce, butneither a miner 145 nor other participant may be able to determine theoriginal input data solely from the hash value. Other digital assetnetworks may use different proof of work algorithms, such as asequential hard memory function, like scrypt, which may be used forLitecoin. As a result, generating a new valid block with a header lessthan the target prescribed by the digital asset network may be initiallydifficult for a miner 145, yet other miners 145 can easily confirm aproposed block by running the hash function at least once with aproposed nonce and other identified input data. In embodiments, aminer's proposed block may be added to the blockchain once a definedpercentage or number of nodes (e.g., a majority of the nodes) on thedigital asset network confirms the miner's work. A miner 145 may have averifier 160, which may confirm other miners' work. A verifier 160 maybe one or more computers, software, or specialized device, to name afew. A miner 145 that solved such a block may receive the reward of afixed number of digital assets and/or any transaction fees paid bytransferors whose transactions are recorded in the block. “Hashing” maybe viewed as a mathematical lottery where miners that have devices withgreater processing power (and thus the ability to make more hashcalculations per second) are more likely to be successful miners 145. Inembodiments, as more miners 145 join a digital asset network and asprocessing power increases, the digital asset network may adjust thecomplexity of the block-solving equation to ensure that onenewly-created block is added to the blockchain approximately every tenminutes. Digital asset networks may use different processing times,e.g., approximately 2.5 minutes for Litecoin, approximately 10 minutesfor Bitcoin, to name a few.

In addition to archiving transactions, a new addition to a ledger cancreate or reflect creation of one or more newly minted digital assets,such as bitcoins. In embodiments, new digital math-based assets may becreated through a mining process, as described herein. In embodiments,the number of new digital assets created can be limited. For example, inembodiments, the number of digital assets (e.g., bitcoins) minted eachyear is halved every four years until a specified year, e.g., 2140, whenthis number will round down to zero. At that time no more digital assetswill be added into circulation. In the exemplary embodiment of bitcoins,the total number of digital assets will have reached a maximum of 21million assets in denomination of bitcoins. Other algorithms forlimiting the total number of units of a digital math-based asset can beused consistent with exemplary embodiments of the present invention. Forexample, the Litecoin network is anticipated to produce 84 millionLitecoins. In embodiments, the number of digital assets may not becapped and thus may be unlimited. In embodiments, a specified number ofcoins may be added into circulation each year, e.g., so as to create a1% inflation rate.

In embodiments, the mining of digital assets may entail solving one ormore mathematical calculations. In embodiments, the complexity of themathematical calculations may increase over time and/or may increase ascomputer processing power increases. In embodiments, result of solvingthe calculations may be the addition of a block to a blockchain, whichmay be a transaction ledger, as described further below. Solving thecalculations may verify a set of transactions that has taken place.Solving the calculations may entail a reward, e.g., a number of digitalmath-based assets and/or transaction fees from one or more of theverified transactions.

Different approaches are possible for confirming transactions and/orcreating new assets. In embodiments, a digital asset network may employa proof of work system. A proof of work system may require some type ofwork, such as the solving of calculations, from one or more participants(e.g., miners 145) on the network to verify transactions and/or createnew assets. In embodiments, a miner 145 can verify as many transactionsas computationally possible. A proof of work system may becomputationally and/or energy intensive. In embodiments, the network maylimit the transactions that a miner 145 may verify.

In embodiments, a digital asset network may employ a proof of stakesystem. In a proof of stake system, asset ownership may be tied totransaction verification and/or asset creation. Asset ownership caninclude an amount of assets owned and/or a duration of ownership. Theduration of ownership may be measured linearly as time passes while auser owns an asset. In an exemplary embodiment, a user holding 4% of alldigital assets in a proof of stake system can generate 4% of all blocksfor the transaction ledger. A proof of stake system may not require thesolution of complex calculations. A proof of stake system may be lessenergy intensive than a proof of work system. In embodiments, a hybridof proof of work and proof of stake systems may be employed. Forexample, a proof of work system may be employed initially, but as thesystem becomes too energy intensive, it may transition to a proof ofstake system.

In embodiments, asset creation and/or transaction confirmation can begoverned by a proof of stake velocity system. Proof of stake velocitymay rely upon asset ownership where the function for measuring durationof ownership is not linear. For example, an exponential decay timefunction may ensure that assets more newly held correspond to greaterpower in the system. Such a system can incentivize active participationin the digital math-based asset system, as opposed to storing assetspassively.

In embodiments, a proof of burn system may be employed. Proof of burnmay require destroying assets or rendering assets unspendable, such asby sending them to an address from which they cannot be spent.Destroying or rendering assets unusable can be an expensive task withinthe digital math-based asset system, yet it may not have external costssuch as the energy costs that can be associated with mining in a proofof work system.

Digital Asset Accounts and Transaction Security

Digital assets may be associated with a digital asset account, which maybe identified by a digital asset address. A digital asset account cancomprise at least one public key and at least one private key, e.g.,based on a cryptographic protocol associated with the particular digitalasset system, as discussed herein. One or more digital asset accountsmay be accessed and/or stored using a digital wallet, and the accountsmay be accessed through the wallet using the keys corresponding to theaccount.

Public Keys

A digital asset account identifier and/or a digital wallet identifiermay comprise a public key and/or a public address. Such a digital assetaccount identifier may be used to identify an account in transactions,e.g., by listing the digital asset account identifier on a decentralizedelectronic ledger (e.g., in association with one or more digital assettransactions), by specifying the digital asset account identifier as anorigin account identifier, and/or by specifying the digital assetaccount identifier as a destination account identifier, to name a few.The systems and methods described herein involving public keys and/orpublic addresses are not intended to exclude one or the other and areinstead intended generally to refer to digital asset accountidentifiers, as may be used for other digital math-based asset. A publickey may be a key (e.g., a sequence, such as a binary sequence or analphanumeric sequence) that can be publicly revealed while maintainingsecurity, as the public key alone cannot decrypt or access acorresponding account. A public address may be a version of a publickey. In embodiments, a public key may be generated from a private key,e.g., using a cryptographic protocol, such as the Elliptic Curve DigitalSignature Algorithm (“ECDSA”).

In exemplary embodiments using bitcoins, a public key may be a 512-bitkey, which may be converted to a 160-bit key using a hash, such as theSHA-256 and/or RIPEMD-160 hash algorithms. The 160-bit key may beencoded from binary to text, e.g., using Base58 encoding, to produce apublic address comprising non-binary text (e.g., an alphanumericsequence). Accordingly, in embodiments, a public address may comprise aversion (e.g., a shortened yet not truncated version) of a public key,which may be derived from the public key via hashing or other encoding.In embodiments, a public address for a digital wallet may comprisehuman-readable strings of numbers and letters around 34 characters inlength, beginning with the digit 1 or 3, as in the example of175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W. The matching private key may bestored in a digital wallet or mobile device and protected by a passwordor other techniques and/or devices for providing authentication.

In other digital asset networks, other nomenclature mechanisms may beused, such as a human-readable string of numbers and letters around 34characters in length, beginning with the letter L for Litecoins or M orN for Namecoins or around 44 characters in length, beginning with theletter P for PPCoins, to name a few.

Private Keys

A private key in the context of a digital math-based asset, such asbitcoins, may be a sequence such as a number that allows the digitalmath-based asset, e.g., bitcoins, to be transferred or spent. Inembodiments, a private key may be kept secret to help protect againstunauthorized transactions. In a digital asset system, a private key maycorrespond to a digital asset account, which may also have a public keyor other digital asset account identifier. While the public key may bederived from the private key, the reverse may not be true.

In embodiments related to the Bitcoin system, every Bitcoin publicaddress has a matching private key, which can be saved in the digitalwallet file of the account holder. The private key can be mathematicallyrelated to the Bitcoin public address and can be designed so that theBitcoin public address can be calculated from the private key, butimportantly, the same cannot be done in reverse.

A digital asset account, such as a multi-signature account, may requirea plurality of private keys to access it. In embodiments, any number ofprivate keys may be required. An account creator may specify the numberof required keys (e.g., 2, 3, 5, to name a few) when generating a newaccount. More keys may be generated than are required to access and/oruse an account. For example, 5 keys may be generated, and anycombination of 3 of the 5 keys may be sufficient to access a digitalasset account. Such an account setup can allow for additional storageand security options, such as backup keys and multi-signaturetransaction approval, as described herein.

Because a private key provides authorization to transfer or spenddigital assets such as bitcoins, security of the private key can beimportant. Private keys can be stored via electronic computer files, butthey may also be short enough that they can be printed or otherwisewritten on paper or other media. An example of a utility that allowsextraction of private keys from an electronic wallet file for printingpurposes is Pywallet. Other extraction utilities may also be usedconsistent with the present invention.

In embodiments, a private key can be made available to a program orservice that allows entry or importing of private keys in order toprocess a transaction from an account associated with the correspondingpublic key. Some wallets can allow the private key to be importedwithout generating any transactions while other wallets or services mayrequire that the private key be swept. When a private key is swept, atransaction is automatically broadcast so that the entire balance heldby the private key is sent or transferred to another address in thewallet and/or securely controlled by the service in question.

In embodiments, using Bitcoin clients, such as BlockChain.info's MyWallet service and Bitcoin-QT, a private key may be imported withoutcreating a sweep transaction.

In embodiments, a private key, such as for a Bitcoin account, may be a256-bit number, which can be represented in one or more ways. Forexample, a private key in a hexadecimal format may be shorter than in adecimal format. For example, 256 bits in hexadecimal is 32 bytes, or 64characters in the range 0-9 or A-F. The following is an example of ahexadecimal private key:

-   -   E9 87 3D 79 C6 D8 7D C0 FB 6A 57 78 63 33 89 F4 45 32 13 30 3D        A6 1F 20 BD 67 FC 23 3A A3 32 62

In embodiments, nearly every 256-bit number is a valid private key.Specifically, any 256-bit number between 0x1 and 0xFFFF FFFF FFFF FFFFFFFF FFFF FFFF FFFE BAAE DCE6 AF48 A03B BFD2 5E8C D036 4141 is a validprivate key. In embodiments, the range of valid private keys can begoverned by the secp256k1 ECDSA standard used by Bitcoin. Otherstandards may also be used.

In embodiments, a shorter form of a private key may be used, such as abase 58 Wallet Import format, which may be derived from the private keyusing Base58 and/or Base58Check encoding. The Wallet Import format maybe shorter than the original private key and can include built-in errorchecking codes so that typographical errors can be automaticallydetected and/or corrected. For private keys associated with uncompressedpublic keys, the private key may be 51 characters and may start with thenumber 5. For example, such a private key may be in the followingformat:

-   -   5Kb8kLP9zgWQnogidDA76MzPL6TsZZY36hWXMssSzNydYXYB9KF

In embodiments, private keys associated with compressed public keys maybe 52 characters and start with a capital L or K.

In embodiments when a private key is imported, each private key mayalways correspond to exactly one Bitcoin public address. In embodiments,a utility that performs the conversion can display the matching Bitcoinpublic address.

The Bitcoin public address corresponding to the sample above is:

-   -   1CC3X2gu58d6wXUWMffpuzN9JAfTUWu4Kj

In embodiments, a mini private key format can be used. Not every privatekey or Bitcoin public address has a corresponding mini private key; theyhave to be generated a certain way in order to ensure a mini private keyexists for an address. The mini private key is used for applicationswhere space is critical, such as in QR codes and in physical bitcoins.The above example has a mini key, which is:

-   -   SzavMBLoXU6kDrqtUVmffv

In embodiments, any bitcoins sent to the designated address1CC3X2gu58d6wXUWMffpuzN9JAfTUWu4Kj can be transferred or spent byanybody who knows the private key in any of the three formats (e.g.,hexadecimal, base 58 wallet format, or mini private key). That includesbitcoins presently at the address, as well as any bitcoins that are eversent to it in the future. The private key is only needed to transfer orspend the balance, not necessarily to see it. In embodiments, thebitcoin balance of the address can be determined by anybody with thepublic Block Explorer athttp://www.blockexplorer.com/address/1CC3X2gu58d6wXUWMffpuzN9JAfTUWu4Kj—evenif without access to the private key.

In embodiments, a private key may be divided into segments, encrypted,printed, and/or stored in other formats and/or other media, as discussedherein.

Digital Wallets

In embodiments, digital math-based assets can be stored and/ortransferred using either a website or software, such as downloadedsoftware. The website and/or downloadable software may comprise and/orprovide access to a digital wallet. Each digital wallet can have one ormore individual digital asset accounts (e.g., digital asset addresses)associated with it. Each user can have one or more digital wallets tostore digital math-based assets, digital crypto-currency, assets and thelike and/or perform transactions involving those currencies or assets.In embodiments, service providers can provide services that are tied toa user's individual account.

Digital wallets and/or the digital asset accounts associated with and/orstored by a digital wallet may be accessed using the private key (whichmay be used in conjunction with a public key or variant thereof).Accordingly, the generation, access, use, and storage of digital assetaccounts is described herein with respect to generation, access, use,and storage of digital wallets. Such descriptions are intended to berepresentative of digital asset accounts and not exclusive thereof.

A digital wallet can be generated using a digital asset client 110(e.g., a Bitcoin client). In embodiments, a digital wallet can becreated using a key pair system, such as an asymmetric key pair like apublic key and a private key. The public key can be shared with othersto designate the address of a user's individual account and/or can beused by registries and/or others to track digital math-based assettransactions involving a digital asset account associated with thedigital wallet. Such transactions may be listed or otherwise identifiedby the digital wallet. The public key may be used to designate arecipient of a digital asset transaction. A corresponding private keycan be held by the account holder in secret to access the digital walletand perform transactions. In embodiments, a private key may be a 256-bitnumber, which can be represented by a 64-character hexadecimal privatekey and/or a 51-character base-58 private key. As discussed herein,private keys of other lengths and/or based on other numbering systemscan be used, depending upon the user's desire to maintain a certainlevel of security and convenience. Other forms of key pairs, or securitymeasures can be used consistent with embodiments of the presentinvention.

In embodiments, a digital wallet may store one or more private keys orone or more key pairs which may correspond to one or more digital assetaccounts.

In embodiments, a digital wallet may be a computer software wallet,which may be installed on a computer. The user of a computer softwarewallet may be responsible for performing backups of the wallet, e.g., toprotect against loss or destruction, particularly of the private and/orpublic key. In embodiments, a digital wallet may be a mobile wallet,which may operate on a mobile device (e.g., mobile phone, smart phone,cell phone, iPod Touch, PDA, tablet, portable computer, to name a few).In embodiments, a digital wallet may be a website wallet or a webwallet. A user of a web wallet may not be required to perform backups,as the web wallet may be responsible for storage of digital assets.Different wallet clients may be provided, which may offer differentperformance and/or features in terms of, e.g., security, backup options,connectivity to banks or digital asset exchanges, user interface, and/orspeed, to name a few.

Signatures

A transaction may require, as a precondition to execution, a digitalasset signature generated using a private key and associated public keyfor the digital asset account making the transfer. In embodiments, eachtransaction can be signed by a digital wallet or other storage mechanismof a user sending a transaction by utilizing a private key associatedwith such a digital wallet. The signature may provide authorization forthe transaction to proceed, e.g., authorization to broadcast thetransaction to a digital asset network and/or authorization for otherusers in a digital asset network to accept the transaction. A signaturecan be a number that proves that a signing operation took place. Asignature can be mathematically generated from a hash of something to besigned, plus a private key. The signature itself can be two numbers suchas r and s. With the public key, a mathematical algorithm can be used onthe signature to determine that it was originally produced from the hashand the private key, without needing to know the private key. Signaturescan be either 73, 72, or 71 bytes long, to name a few.

In embodiments, the ECDSA cryptographic algorithm may be used to ensurethat digital asset transactions (e.g., bitcoin transactions) can only beinitiated from the digital wallet holding the digital assets (e.g.,bitcoins). Alternatively or in addition, other algorithms may beemployed.

In embodiments, a transaction from a multi-signature account may requiredigital asset signatures from a plurality of private keys, which maycorrespond to the same public key and/or public address identifying themulti-signature digital asset account. As described herein, a greaternumber of private keys may be created than is necessary to sign atransaction (e.g., 5 private keys created and only 3 required to sign atransaction). In embodiments, private keys for a multi-signature accountmay be distributed to a plurality of users who are required to authorizea transaction together. In embodiments, private keys for amulti-signature account may be stored as backups, e.g., in securestorage, which may be difficult to access, and may be used in the eventthat more readily obtainable keys are lost.

Market Places

A digital asset market place, such as a Bitcoin market place, cancomprise various participants, including users, vendors, exchanges,exchange agents, and/or miners/mining pools. The market contains anumber of digital asset exchanges, which facilitate trade of digitalassets using other currencies, such as United States dollars. Exchangesmay allow market participants to buy and sell digital assets,essentially converting between digital assets (e.g., bitcoins) andcurrency, legal tender, and/or traditional money (e.g., cash). Inembodiments, a digital asset exchange market can include a globalexchange market for the trading of digital assets, which may containtransactions on electronic exchange markets. In accordance with thepresent invention, exchanges and/or transmitters may also be used tofacilitate other transactions involving digital assets, such as wheredigital assets are being transferred from differently denominatedaccounts or where the amount to transfer is specified in a differentdenomination than the digital asset being transferred, to name a few.Bitstamp is one example of a Bitcoin exchange 130. A Bitcoin exchangeagent 135 can be a service that acts as an agent for exchanges,accelerating the buying and selling of bitcoins as well as the transferof funds to be used in the buying and/or selling of bitcoins. Coinbaseis an example of a company that performs the role of a Bitcoin exchangeagent 135. Coinbase engages in the retail sale of bitcoin, which itobtains, at least in part, from one or more exchanges. FIG. 3illustrates an exemplary Coinbase website interface for buying bitcoin.Other Coinbase options include “Sell Bitcoin,” “Send Money,” “RequestMoney,” and “Recurring Payments.” Other options could also be madeavailable consistent with exemplary embodiments of the presentinvention.

In addition to the services that facilitate digital asset transactionsand exchanges with cash, digital asset transactions can occur directlybetween two users. In exemplary uses, one user may provide payment of acertain number of digital assets to another user. Such a transfer mayoccur by using digital wallets and designating the public key of thewallet to which funds are being transferred. As a result of thecapability, digital assets may form the basis of business and othertransactions. Digital math-based asset transactions may occur on aglobal scale without the added costs, complexities, time and/or otherlimits associated with using one or more different currencies.

Vendors 140 may accept digital assets as payment. A vendor 140 may be aseller with a digital wallet that can hold the digital asset. Inembodiments, a vendor 140 may be a larger institution with aninfrastructure arranged to accept and/or transact in digital assets.Various vendors 140 can offer banknotes and coins denominated inbitcoins; what is sold is really a Bitcoin private key as part of thecoin or banknote. Usually, a seal has to be broken to access the Bitcoinprivate key, while the receiving address remains visible on the outsideso that the bitcoin balance can be verified. In embodiments, a debitcard can be tied to a Bitcoin wallet to process transactions.

Setup and Storage of Digital Assets and/or Digital Wallets

Digital asset accounts may be securely generated, accessed, and/or used(e.g., for transactions) from a secure administrative portal. Inembodiments, the administrative portal, which may be used for keygeneration, parsing, and/or reassembly, may be a secure system fortransacting in digital math based assets comprising a first computersystem comprising one or more processors that generate one or moredigital wallets and one or more respective private keys and one or morerespective public keys, each of the one or more private keys beingsegmented into one or more private key segments; one or more writingdevices operatively connected to the one or more first computer systems,each of the one or more writing devices adapted to write at least oneprivate key segment of a corresponding one of the one or more privatekeys, along with information correlating the at least one private keysegment to one of the one or more public keys; and at least onenetworked computer comprising one or more processors that access atleast one of the digital wallets using a corresponding one of the one ormore private keys as reassembled using the corresponding private keysegments.

In embodiments, the administrative portal may further comprise a secondcomputer system comprising one or more processors for reassembling thecorresponding one of the one or more private keys based on input intothe second computer system of the corresponding private key segments. Inembodiments, the input device may be a scanner, a keyboard, atouchscreen, a mouse, a microphone, a camera, and/or a digital cardreader, to name a few.

In embodiments, the first computer system of the administrative portaland/or the second computer system may not be associated with a network.In embodiments, the first computer system of the administrative portaland the networked computer system may be a common computer system. Inembodiments, the second computer system of the administrative portal andthe networked computer system may comprise a common computer system. Infurther embodiments, the first computer system, the second computersystem, and the networked computer system may be a common computersystem.

In embodiments, referring to FIGS. 4A-4D, the administrative portal maycomprise an accounting computer 25 and a secure location 10, asdescribed herein.

Referring to the exemplary embodiment illustrated in FIG. 4A, at asecure location 10, a digital asset account holder, administrator,manager, and/or custodian may maintain at least two computers. Inembodiments, an administrator, manager, and/or custodian may becontracted to manage one or more digital asset accounts and/or overseesecurity for the accounts. In embodiments, secure location 10 may be aroom with restricted entry. In embodiments, secure location 10 may havea user entry log to provide an access record for the location.

In the exemplary embodiment depicted in FIG. 4A, at secure location 10,the first computer may be a networked computer 20, which may compriseone or more computing devices. Networked computer 20 and/or othercomputers in the system may have the ability to cycle or otherwisechange IP addresses. The second computer may be a non-networked,isolated computer 30, which may comprise one or more computing devices.In embodiments, the networked computer 20 and the isolated computer 30may be separate aspects of one computing device. For example, a harddrive partition may be used to separate the networked and non-networkedfunctions. In embodiments, the computers may comprise one or moreprocessors and/or computer readable memory. Networked computer 20 andisolated computer 30 may be located in close proximity to each other, asin the same room, or may be located in separate locations within securelocation 10. It will be appreciated by those in the art that securelocation 10 may comprise a plurality of secure locations. Inembodiments, isolated computer 30 may be located in a Faraday cage 50.The Faraday cage 50 may prevent electronic eavesdropping or interferencefrom electromagnetic waves. In alternative embodiments, the functionsascribed above to networked computer 20 and isolated computer 30 may beperformed by one or more networked and/or isolated computers at one ormore locations.

In the exemplary embodiment depicted in FIG. 4A, networked computer 20can communicate with a registry, exchange, other external entities,e.g., APs, and/or all or part of a digital asset network to send and/orreceive digital assets (e.g., to create transactions), to computebalances, and/or to transmit or otherwise broadcast signed or otherwisefinalized transactions. In embodiments, networked computer 20 may beused to distribute digital assets among one or more digital assetaccounts and/or digital wallets. The networked computer 20 may beconnected to the Internet directly (e.g., through Ethernet, Wi-Fi,Bluetooth, or any connection known in the art or hereafter developed) orindirectly (e.g., through another computer to which it is directlyconnected), or may be connected to a network other than the Internet.

In embodiments, the digital assets may be stored in one or more digitalwallets residing on one or more computing devices, such as remoteservers, personal computers, tablet devices, mobile devices, such assmart phones, or PDAs, to name a few. In the exemplary embodiment ofFIG. 4A, isolated computer 30 may be used to generate electronic walletsand/or key pairs, which may include both private and public keys. Inembodiments, keys comprise strings or alphanumeric characters or othercharacters, optionally of a pre-determined length, may comprise one ormore pieces of computer code, or may comprise other formats of keysknown in the art. In embodiments, digital wallets may be created onisolated computer 30 using a “clean-boot” with a bootable CD, such as aLinux Live CD. The specific version of the operating system may bemaintained in secret to avoid security risks.

In embodiments, digital asset accounts and/or digital wallets may begenerated by an entity upon receipt of a request to transfer digitalassets to the entity and/or may be pre-generated at the time thatsecurity measures (e.g., a vault storage system) is set up, to name afew. The digital asset accounts each may be associated with uniqueprivate-public key pairs (which may include a plurality of privatekeys). In embodiments, the key pairs may be created as part of thedigital wallet creation process. In other embodiments, the key pairs maybe created before or after the creation of the one or more digitalwallets and associated with the wallets as a separate step. Inembodiments, the assets stored in a digital wallet may be accessed witha key pair, even if the original wallet is destroyed or otherwiseunavailable. In such embodiments, only the key pair need be maintainedand/or stored to retrieve the assets associated with a given digitalwallet. Accordingly, in an embodiment of the present invention, digitalwallets may be deleted or otherwise destroyed following the storage oftheir associated keys. Assets may be added to the wallet even after itsdestruction using the public key. Assets may thus be stored in a walletafter the wallet is destroyed. The wallet may be re-generated using itskeys.

In embodiments, the private key may not be used directly with or on thenetworked computer 20. In embodiments, a public key (without thecorresponding private key) may only be able to receive digital assetsfor deposit purposes. In embodiments, assets may be transferred to awallet using its public key and without the transferor knowing theprivate key. Implementation of the foregoing may require customizedsoftware, e.g., software that modifies the standard digital assetprotocols.

In embodiments, isolated computer 30 may also be used in conjunctionwith, e g., one or more printers or other writing devices, to print thekey pairs or may be used otherwise to arrange for the storage of one ormore aspects and/or portions (or segments or coded and/or encryptedsegments) of the key pairs. A printer 32 or other writing device towrite, print, or otherwise store the keys may be provided with theisolated computer 30. Such printer(s) and/or other writing device(s) maybe connected, directly and/or indirectly, to the isolated computers,such as through hardwire, wireless, or other connection. That device mayalso be located within a Faraday cage, which may be the same Faradaycage housing isolated computer 30. Storage of the keys is describedfurther below.

In embodiments, one or more isolated computers 30 can be used inconjunction with one or more printers or other writing devices to write,print or otherwise store keys. It will be appreciated by one of skill inthe art, that in embodiments it may be desirable to limit the number orprinters or other writing devices to as few as possible to reduce riskof exposure of private keys, while in embodiments it may be desirable tohave a larger number of printers or other writing devices to handle thevolume of wallets and/or keys that need to be generated and/or writtenby the system for its operation.

Private keys may be stored in the selected format along with theircorresponding public keys. In embodiments, the private key may be storedwith a reference number which may correlate the private key to itscorresponding public key. The reference number may be (or may be storedas) a number, alphanumeric code, bar code, QR code, to name a few. Areference number master list may identify a private key, the referencenumber, and the corresponding public key. The reference number masterlist may be printed or etched on paper or some other substrate, may bestored digitally on a tape CD, DVD, computer hard drive, or othermedium, or otherwise stored in a manner known in the art. The substratesor media just described may have any suitable size, includingmicroscopic or nano scales. In embodiments, the reference number masterlist may be stored in a secure storage chamber 60 at secure location 10.Storage chamber 60 may be a lockbox, fireproof box, or other securechamber. If storage is electronic or digital, chamber 60 may protectagainst electromagnetic waves.

The private and/or public keys and/or any reference number may be storedin a variety of formats, as described herein. The keys may be dividedinto separate segments for storage. For example, a 51-character key maybe divided into three 17-character segments. The same reference numberthat correlates the private key to the public key or an additionalreference number or other identifier may indicate which key segments arepart of the same key. The reference identifier or another identifier maybe provided and stored with the one or more segments to indicate theirorder in the assembled key. A numbering schema or other convention mayalso be used to identify the order of key segments. For example, a firstsegment may begin with an “A”, a second segment may begin with a “B”,and a third segment may begin with a “C”. The key segments may be storedin one or more locations. In embodiments, the key segments may bedivided among a plurality of vaults 70, as described herein.

In embodiments, keys and/or key segments may be stored digitally and/orelectronically, e.g., on one or more computer hard drive, disk, tape,memory card, flash memory, CD-ROM, and/or DVD, to name a few. Inembodiments, the keys and/or key segments may be printed on anysubstrate, including paper, papyrus, plastic, and/or any substrate knownin the art. In embodiments, the substrate may be fireproof or fireresistant, such as a fireproof plastic. The substrate may be resistantto fluids, e.g., water resistant, or otherwise nonabsorbent. Otherprinting options may be holographic printing, three-dimensionalprinting, raised printing, such as Braille lettering, and/or invisibleink printing, such as using inks that require a special light and/ortreatment, e.g., heat and/or chemicals, for viewing. In embodiments,keys may be etched, e.g., in wood, metal, glass, plastic, or othercompositions known in the art, e.g., to produce a card. In embodiments,a magnetic encoding may be used to write to the card. In embodiments,etched or printed keys or key segments may take any shape, such ascoin-shaped tokens or rectangular blocks, to name a few. In embodiments,keys or key segments may be printed, etched, or otherwise stored asalphanumeric strings. In embodiments, keys or key segments may beprinted, etched, or otherwise stored in a form readable by programmeddevices, such as scanners. Such a form may be a QR code, a bar code,another available scannable code format and/or a proprietary codeformat. In embodiments, quality control operations may ensure that thekeys or key segments are printed accurately and/or are able to be read.In embodiments, printed or etched keys or key segments may be coated toprevent reading the key without removing or otherwise altering thecoating. Such a coating may be a UV coating and/or may block X-rays orother forms of scanning or reading. The coating may be scratched off toreveal the data contained below it. The back of the substrate may alsobe coated to prevent reading through the substrate. Such a coating mayprovide an indication of whether a printed key or key segment wasaccessed or attempted to be accessed (e.g., it can be detected whethersomeone scratched the coating away).

In embodiments, security measures may be established and implemented toreduce the risk of digital wallets being compromised. Further,redundancies can be put in place to provide and/or help ensure that anyinformation necessary to access digital math-based assets in digitalwallets can be maintained and/or accessed by the account holders asappropriate, necessary, and/or desired.

Multiple private keys may be required to access a digital wallet.Multiple keys may be stored in the same manner as key segments. Inembodiments, where a second private key is required, the one or moreindividuals or systems providing the second key may be located indifferent administrative portals, different rooms, and/or differentgeographies from the one or more individuals or systems providing thefirst private key. Accordingly, a plurality of administrative portalsmay be employed by secure digital asset storage systems in accordancewith the present invention. In embodiments, a plurality of portals maybe used for retrieval of stored digital assets (e.g., by requiring asignature or private key from at least two individuals located in atleast two different portals). In embodiments, one portal may be used forre-assembling key segments and thus providing one private key, and anindividual in a second location may be required to provide a second keyor signature before a digital wallet may be accessed. The second key orsignature may be encrypted and/or segmented as described herein withrespect to a single private key.

In embodiments, a digital wallet may have more than one private key(e.g., multi-signature wallets). The plurality of private keys may bestored securely in the same manner as a single private key. Each privatekey segment pertaining to a single wallet may be stored in separatevaults, which may be electronic and/or physical vaults. By allowing formulti-signature wallets, the wallet can provide for approval/signatureauthority from more than one individual or entity as a further means tocontrol access to digital assets held in such wallet. In embodiments, asignature authority may be an automated electronic signature authority,such as a computer or computer system programmed with transactionapproval rules. The automated electronic signature authority may onlyprovide a signature when a transaction satisfies the transactionapproval rules. In other embodiments, required signature authorities maybe individuals who may be located in different administrative portals,different rooms, and/or different geographies. Accordingly, a pluralityof administrative portals may be employed by secure digital assetstorage systems in accordance with the present invention. Inembodiments, one portal may be used for re-assembling key segments andthus providing one private key, and an individual or system in a secondlocation may be required to provide a second key or signature before adigital wallet may be accessed. The second location may be a secondportal, a location in a different building, and/or a differentgeography, to name a few. The second key or signature may be encryptedand/or segmented as described herein with respect to a single privatekey.

Keys or key segments may be encrypted and/or ciphered, using one or moreciphers, as an additional security measure. The encryption and/orciphers may be applied by computers running encryption software,separate encryption devices, or by the actions of one or more persons,e.g., prior to input of the encrypted and/or ciphered data into one ormore computers. In embodiments, a key may be stored in reverse orderand/or translated (e.g., by adding 1 to each digit and/or advancing eachalphabetic character by one position in the Western alphabet, bysubstitution such as by mapping each character to a different character(e.g., A=3, 5=P, to name a few), to name a few). In embodiments, otherencryption algorithms can comprise scrambling of a sequence ofcharacters, addition of characters, and/or hashing. Other encryptiontechniques are possible. See, e.g., David Kahn, The Codebreakers: TheStory of Secret Writing, 1967, ISBN 0-684-83130-9. See also, BruceSchneier, Applied Cryptography, John Wiley & Sons, 1994, ISBN:0-471-59756-2. The encryption and/or ciphers may protect against use ofthe keys by an unauthorized entity who obtains the keys or key segmentsor copies thereof. The encoding and/or cipher may be maintained insecret and applied to decrypt or decode the keys only when keys must beaccessed and used. In embodiments, ciphering may refer to analphanumeric translation or reordering, while encryption may refer tohigher level algorithms, including hashing algorithms. In embodiments,encryption and ciphering may refer to the same processes, in which casedescriptions herein of processes involving both encryption and cipheringsteps may only entail performance of one such step so as not to berepetitive.

Following storage of the key pairs, the key pairs may be erased fromisolated computer 30. Erasure may occur using the computer operatingsystem's delete features, customized software or computer code designedto remove the data from computer memory, magnets used to physicallyerase the data from the computer's storage drives, and/or othertechniques known in the art.

A key reader 40 may be provided to assemble, read, and/or de-crypt thekeys or key segments. The key reader 40 may be contained within aFaraday cage, which may be the same Faraday cage housing isolatedcomputer 30. The key reader 40 may read keys that are printed, etched,digitally stored, or otherwise stored. Key reader 40 may be a scanner(e.g., photo scanner or bar code scanner), QR reader, laser, computerhardware, CD reader, and/or digital card reader, to name a few. Keyreader 40 may include or be operationally connected to a microscope ormagnifying device, such as for keys that are printed in microscopicsizes or other small sizes. In embodiments, key reader 40 may be pairedwith optical character recognition (“OCR”) technology to createdigitally recognized copies of keys that may have been printed, etched,or otherwise stored in a form not immediately readable by a computer.

In embodiments, key reader 40 may comprise an input device, such as akeyboard, touchscreen, mouse, and/or microphone, to name a few. An inputdevice may be used for manual entry of keys and/or key segments into oneor more computers so that the computer may further process the keysegments. Key reader 40 may be operationally connected to isolatedcomputer 30, which may be a direct connection (e.g., a USB cable,Ethernet cable, Bluetooth, or Wi-Fi, to name a few). In embodiments, keyreader 40 may be operationally connected to networked computer 20. Keyreader 40 may be operationally connected to a separate computing device.

In embodiments, reassembled keys may be input directly into a networkedcomputer 20, which may then be used to access one or more digitalwallets and/or perform one or more transactions. Key reader 40 and/orcorresponding software (e.g., running on a computer operationallyconnected to the key reader) may be programmed or otherwise designed toassemble key segments into completed keys. Key reader 40 and/orcorresponding software (e.g., running on a computer operationallyconnected to the key reader) may also correlate the private keys withtheir corresponding public keys, optionally using the reference numbermaster list. In embodiments, one or more pieces of software may be usedto retrieve, decrypt, assemble, and/or decipher keys and/or keysegments. In embodiments, such software may be run on any of one or moresecure storage system computers and/or user devices. In embodiments,multiple authority may be required to initiated a retrieval of storedprivate keys.

In embodiments, a back-up isolated computer 35 and/or a back-up keyreader 45 may be provided at secure location 10, as illustrated in FIGS.4A-4C. The back-up isolated computer 35 and key reader 45 may becontained in a back-up Faraday cage 55, which may be separate from mainFaraday cage 50. In embodiments, all or part of the administrativeportal may be duplicated and/or backed up. A duplicate administrativeportal or portion thereof may be located in a separate geographic area.A duplicate portal may serve as a disaster recovery operations portal.

In embodiments, a digital math-based asset miner, such as a bitcoinminer, may be located at or within the administrative portal. The minermay be one or more computers. In embodiments, the miner may beoperationally connected to any of the computers and/or devices at theadministrative portal described above.

In embodiments, referring to FIG. 4D, the secure location can house oneor more networked computers 20, one or more accounting computers 25, oneor more digital asset miner computers 65, one or more isolatedtransaction computers 32 operatively connected to one or more keyreaders 40, and one or more isolated wallet computers 30′, operativelyconnected to one or more writing devices 32 and, in embodiments, to oneor more key readers 40. Each isolated transaction computer 60 and/orisolated wallet computer 30′ may be isolated from each other and/orother computers electronically using a secure environment, such as aFaraday cage 50, 60.

One or more vaults 70, 70-1, 70-2, 70-3,70-N, may be used to holdassets. Vaults may be any secure storage facilities, structures, and/orsystems. For example, a vault may be a bank vault or a safety depositbox. Vaults may have appropriately controlled environments (e.g.,regulated temperature and/or humidity, to name a few) to enablelong-term storage of keys and/or key segments substrates. Vaults may beoperated by one or more entities, which may be separate entities. Inembodiments, only bonded employees may be permitted access to thevaults. Also, vaults may be located in one or more physical (e.g.,geographic) and/or digital (e.g., residing on one or more separatecomputer servers or hard drives) locations. In embodiments, vaults maybe used in conjunction with digital wallets and/or other devices and/orsystems known in the art for storing digital assets and/or data.

In the exemplary embodiments of FIGS. 4A-D, the private keys 80 may bedivided into three segments, 80-1, 80-2, and 80-3 for storage. Eachsegment may be stored in a separate one of vaults 70-1, 70-2, and 70-3.In embodiments, two segments, four segments, five segments or anothernumber of segments can be used in accordance with embodiments thepresent invention. In embodiments, each key segment may be stored in avault operated by the same entity or by one or more different entities.

In embodiments, one or more duplicate copies of each key or key segmentmay be produced. Such duplicate copies may be stored in separate vaults,e.g., three sets of keys split into three segments may be stored in ninevaults, four sets of keys split into two segments may be stored in eightvaults, and/or the copies of key segments may be distributed among someother number of vaults, to name a few. See, e.g., FIGS. 9A-9D, to name afew. Duplicate copies may serve as a back-up in case one copy of a keyor key segment becomes corrupted, lost, or otherwise unreadable.

In embodiments, vaults may hold the keys in an organized or categorizedfashion so as to facilitate location of one or more keys or keysegments. In embodiments, a sorting reference number may be used toorganize the keys or key segments. The sorting reference number may bethe same as the reference number that correlates private and publickeys. In embodiments, etched coins or other materials or printed keys orkey segments may be stacked or otherwise arranged according to thereference number. In embodiments, an index or card catalog may describethe location of the keys. In embodiments, an automated machine may storeand retrieve key segments from storage slots, which machine may receivean input to indicate which keys or key segments to retrieve.

FIG. 5A illustrates an exemplary embodiment of a process for creatingdigital wallets and storing their keys. In a step S02 one or moredigital wallets may be created using one or more isolated walletcomputers 30′. In a step S04, the public and private keys associatedwith the created digital wallets may be obtained using one or moreisolated wallet computers 30′. In embodiments, referring to FIG. 5B, ina step S05 each private key may be ciphered. In a step S06, each privatekey, which may be a ciphered private key following step S05, may bedivided into segments. In a step S08, one or more duplicate copies ofeach private key segment may be created. In some embodiments, theprivate key may be divided into 2, 3, 4 or more segments. Inembodiments, each private key segment may be encrypted or otherwiseencoded in a step S10. In embodiments, steps S08 and/or S10 may beskipped. In a step S12, each private key segment may be associated witha reference number, correlating the private key segment to therespective public key and/or indicating the order of the private keysegment within the complete key. In a step S14, each encrypted privatekey segment may be converted to a storable medium, such as by printingeach private key segment on paper. In a step S16, the private keysegment as converted in the storable medium (e.g., printed) is verifiedto confirm it was properly and retrievable stored. In embodiments, thisstep may be skipped. In a step S18, each private key segment is storedalong with its reference number at one or more secure locations. In astep S20, each digital wallet is deleted, leaving the stored keys as ameans to regenerate the wallets.

FIG. 6A is a flow chart of a process for generating digital assetaccounts and securely storing the keys corresponding to each account. Inembodiments, the process may be performed using one or more isolatedcomputers not connected to any external data networks. The isolatedcomputer may comprise a clean copy of an operating system (e.g., a cleanboot) stored in computer-readable memory and running on one or moreprocessors.

In a step S6002, a computer system comprising one or more computers maybe used to generate one or more digital asset accounts capable ofholding one or more digital math-based assets. In embodiments, suchaccounts may be associated with digital asset ownership and/orpossession without physically holding a digital asset in any location. Adigital asset software client, which may comprise part of a digitalwallet or may be accessed using a digital wallet, may be used togenerate the digital asset accounts.

In a step S6004, the computer system may be used to obtain one or moreprivate keys corresponding to the one or more digital asset accounts. Inembodiments, the private keys may be generated as part of the digitalasset account creation process.

In a step S6006, the computer system may be used to divide each of theone or more private keys into a plurality of private key segments. Inembodiments, such as with a multi-signature wallet, at least one privatekey for each digital asset account may be divided into private keysegments.

In a step S6008, the one or more computers may be used to encrypt eachof the plurality of private key segments. Encryption can comprise any ofthe techniques described herein, such as character substitution,scrambling, mapping, and/or hashing, to name a few. The computer systemcan apply one or more algorithms to perform the encryption. Symmetricand or asymmetric encryption algorithms may be applied.

In a step S6010, the one or more computers may be used to generateand/or associate each of the plurality of private key segments with arespective reference identifier. A reference identifier may be a number,alphanumeric sequence, or other unique sequence that can be used toidentify key segments, which may be used for storage and/or retrieval ofkey segments. The reference identifier for each key segment may bestored on a reference identifier master list, which may be storedelectronically and/or on a physical substrate. The reference identifiermaster list may associate with each other the reference identifiers forkey segments corresponding to the same key, and/or may also associate adigital asset account identifier (e.g., a public key or public address)with the key segments.

In a step S6012, the one or more computers may be used to create one ormore cards for each of the encrypted plurality of private key segments.Each card may have fixed thereon one of the encrypted plurality ofprivate key segments along with the respective associated referenceidentifier. The cards may be paper, such as index cards, 8½ in.×11 in.sheets of paper, or other paper products. In other embodiments, thecards may include plastic or metal. The cards may be laminated. Awriting device may fix the key segments and reference identifiers to thecards by techniques such as printing, etching, and/or magneticallyencoding, to name a few. A scannable code, such as a bar code or QRcode, may be used to write the keys to the cards.

In embodiments, collated sets of cards may be produced for a pluralityof digital asset accounts. Each set may contain only one card perprivate key such that the private key segments for a single private keyare divided among different sets of cards.

In embodiments, following creation of the one or more cards, qualitycontrol steps can be performed. A reading device may be used to readeach of the cards to ensure readability.

In a step S6014, the one or more computers may be used to track storageof each of the one or more cards in one or more vaults. Vaults may begeographically remote. Vaults can include bank vaults and/or preciousmetal vaults. In embodiments, a main set of vaults and one or more setsof backup vaults may be used. A main set of vaults can be located in ageographically proximate area, such as a metropolitan area of a city,while backup sets of vaults may be located in geographically remoteareas. The backup vaults may contain duplicate copies of the cards.Vault locations for each card or set of cards may be included on thereference identifier master list.

In embodiments, the process can further include receiving at thecomputer system a quantity of digital math-based assets, and storingthose digital assets in the one or more securely stored digital assetaccounts. In embodiments, storing the digital asset can comprisetransferring the digital assets into accounts with securely storedprivate keys. Accordingly, storing can comprise generating electronictransfer instructions for an electronic transfer of the quantity ofdigital math-based assets to the one or more digital asset accounts andbroadcasting the electronic transfer instructions to a decentralizedelectronic ledger maintained by a plurality of physically remotecomputer systems.

FIG. 6B is a flow chart of another exemplary process for generatingdigital asset accounts and securely storing the keys corresponding toeach account.

In a step S6022, a computer system comprising one or more computers maybe used to generate one or more digital asset accounts capable ofholding one or more digital math-based assets, as described with respectto step S6002 of FIG. 6A.

In a step S6024, the computer system may be used to obtain one or moreprivate keys corresponding to the one or more digital asset accounts, asdescribed with respect to step S6004 of FIG. 6A.

In a step S6026, the computer system may be used to encrypt each of theone or more private keys.

After encryption, in a step S6028, the computer system may be used todivide each of the encrypted private keys into a plurality of keysegments.

In a step S6030, the one or more computers may be used to generateand/or associate each of the plurality of private key segments with arespective reference identifier.

In a step S6032, the one or more computers may be used to create one ormore cards for each of the plurality of private key segments.

In a step S6034, the one or more computers may be used to track storageof each of the one or more cards in one or more vaults.

FIG. 6C is a flow chart of another exemplary process for generatingdigital asset accounts and securely storing the keys corresponding toeach account. The exemplary process may generate and store keys for, amulti-signature digital asset account, where at least one of the privatekeys is divided into a plurality of key segments.

In a step S6042, a computer system comprising one or more computers maybe used to generate one or more digital asset accounts capable ofholding one or more digital math-based assets.

In a step S6044, the computer system may be used to obtain a firstplurality of private keys corresponding to each of the one or moredigital asset accounts. Each first plurality of private keys cancomprise the private keys of a multi-signature account.

In a step 6046, the computer system may be used to divide a firstprivate key of the first plurality of private keys into a secondplurality of first private key segments. For a multi-signature digitalasset account at least one of the private keys may be divided intoprivate key segments.

In a step S6048, the computer system may be used to encrypt each of thesecond plurality of first private key segments. In embodiments, thesecond key may be encrypted.

In a step S6050, the computer system may be used to generate and/orassociate each of the second plurality of first private key segmentswith a respective reference identifier.

In a step S6052, the computer system may be used to create one or moreone or more cards for each of the encrypted second plurality of firstprivate key segments wherein each of the one or more cards has fixedthereon one of the encrypted second plurality of first private keysegments along with the respective associated reference identifier. Inembodiments, the second key may be written, e.g. using the writingdevice, to one or more physical substrates, such as paper, plastic,and/or metal. In other embodiments, the second key may be storedelectronically.

In a step S6054, the computer system may be used to track storage ofeach of the cards in one or more vaults, as well as to track storage ofthe second private key. A reference identifier master list may identifythe storage locations of each key and key segment.

FIGS. 4B and 4C illustrate exemplary embodiments of the presentinvention where one or more computers 25 running accounting software toaccount for the assets and/or expenses of an account holder can belocated either within the secure location 10 (e.g., FIG. 4B) or outsideof the secure location 10 (e.g., FIG. 4C). In embodiments, suchaccounting software as well as possibly other software may be stored,accessed and/or operated on one or more networked computers 20 in thesecure location 10. In embodiments, the accounting computer 25 may bethe same or different from isolated computer 30 and/or networkedcomputer 20 and/or a mining computer.

In embodiments, an accounting computer 25 may be a hardware securitymodule, which may comprise hardware (e.g., one or more processors,computer-readable memory, communications portals, and/or input devices,to name a few) and/or software (e.g., software code designed to verifytransactions, flag potentially erroneous transactions, and/or stoppotentially erroneous or unauthorized transactions). Such a device mayverify spending transactions before the transactions are executed. Ahardware security module may flag transactions for review (e.g., byportal administrators), before the transactions may be confirmed. Ahardware security module may be an offline device, which may be given adaily account activity log (e.g., a log of ETP redemptions and/orcreations) to determine whether proposed transactions, particularlyspending transactions, are valid. A protocol for identifying owners of adigital wallet may be used to verify that spending transactions willdeliver the correct amount of assets to the correct address. Inembodiments, a quorum of a specified size may be required to override ahardware security module. In embodiments, a transaction may be processedusing both an isolated and a networked computer, as discussed herein.Such a transaction may be performed using an air-gapped digital wallet,such as described in the context of FIG. 4D, and isolated walletcomputer 30′ within faraday cage 50 or the isolated transaction computer32 in faraday cage 60 which are air gapped from network computer 20. Inembodiments, an unsigned transaction may be performed on a networkedcomputer, which may only contain one or more wallets capable of watchingtransactions and/or performing unsigned transactions. A non-networked,isolated computer may contain one or more complete wallets, which may beused to sign transactions. The transaction may be transferred to theisolated computer for signing. Hence, an air gap or other lack of arequired communication connection may exist between the isolated andnetworked computer. In embodiments, the unsigned transaction data may betransferred manually, such as by saving the data from the networkedcomputer to a removable storage medium (e.g., a USB flash drive, CD,CD-ROM, DVD, removable hard drive, disk, memory card, to name a few),and inputting or otherwise operatively connecting the storage medium tothe isolated computer. The isolated computer may then access and signthe transaction data. The signed transaction data may then betransferred back to the networked computer using the same or differentmethod of transfer as used for the unsigned transaction data. Thenetworked computer may then access and upload, distribute, or otherwiseact on the signed transaction data to complete the transaction. Inembodiments, the isolated computer may generate and sign (e.g., with aprivate key) transaction instructions, which may then be transferred tothe networked computer for distribution to the digital asset network. Inembodiments, the networked computer and the isolated computer may beoperatively connected, e.g., using a wired connection (e.g., a USBcable, Ethernet cable, Laplink cable, to name a few) or using a wirelessconnection (e.g., Bluetooth, Wi-Fi, infrared, radio, to name a few).Such operative connection may replace the manual transfer of transactiondata between the computers, and in embodiments, security measures, suchas firewalls or automated separable physical connector devices (e.g.,controlled from the isolated computer), may be employed to protectagainst unauthorized access, particularly to the isolated computer.

FIG. 7 is a flow chart of a process for retrieving securely storedprivate keys in accordance with exemplary embodiments of the presentinvention.

In exemplary embodiments, in step S7002, a computer system comprisingone or more computers may be used to determine one or more digital assetaccount identifiers corresponding to one or more digital asset accountscapable of holding one or more digital math-based assets.

In a step S7004, the computer system may be used to access key storageinformation associated with each of the one or more digital assetaccount identifiers. In embodiments, the key storage information maycomprise a reference identifier associated with one or more storedprivate key segments.

In a step 7006, the computer system may be used to determine, based uponthe key storage information, storage locations corresponding to each ofa plurality of private key segments corresponding to each of the one ormore digital asset accounts.

In a step 7008, retrieval instructions for retrieving each of theplurality of private key segments may be issued or caused to be issued.

In a step 7010, each of the plurality of private key segments may bereceived at the computer system.

In a step 7012, the computer system may be used to decrypt each of theplurality of private key segments.

In a step 7014, the computer system may be used to assemble each of theplurality of private key segments into one or more private keys.

In embodiments, the process depicted in FIG. 7 may further comprise thestep of accessing, using the computer system, the one or more digitalasset accounts associated with the one or more private keys. In furtherembodiments, the process depicted in FIG. 7 may further comprise thesteps of accessing, using an isolated computer of the computer system,wherein the isolated computer is not directly connected to an externaldata network, the one or more digital asset accounts associated with theone or more private keys; generating, using the isolated computer,transaction instructions comprising one or more transfers from the oneor more digital asset accounts; transferring the transactioninstructions to a networked computer of the computer system; andbroadcasting, using the networked computer, the transaction instructionsto a decentralized electronic ledger maintained by a plurality ofphysically remote computer systems.

FIG. 8 describes an exemplary method of performing secure transactions.In a step S702, a digital wallet may be created on an isolated computer.In a step S704, a watching copy of the digital wallet, which may notinclude any private keys, may be created on the isolated computer. In astep S706, the watching copy of the digital wallet may be transferredfrom the isolated computer to a networked computer. In a step S708, anunsigned transaction may be created using the watching copy of thewallet on the networked computer. In a step S710, data associated withthe unsigned transaction may be transferred from the networked computerto the isolated computer. In a step S712, the unsigned transaction datamay be signed using the digital wallet on the isolated computer. In astep S714, the signed transaction data may be transferred from theisolated computer to the networked computer. In a step S716, the signedtransaction data may be broadcast, using the watching copy of the walleton the networked computer, to a digital asset network. In embodiments,the broadcast of a signed transaction may complete a transaction and/orinitiate a verification process that may be performed by the network.

In embodiments, processes for generating digital asset accounts and/orstoring associated keys may be performed by a secure system, e.g., anadministrative portal. The system can comprise an electronic isolationchamber, such as a Faraday cage. The system can further comprise one ormore isolated computers within the electronic isolation chamber andcomprising one or more processors and computer-readable memoryoperatively connected to the one or more processors and having storedthereon instructions for carrying out the steps of (i) generating, usingthe one or more isolated computers, one or more digital asset accountscapable of holding one or more digital math-based assets; (ii)obtaining, using the one or more isolated computers, one or more privatekeys corresponding to the one or more digital asset accounts; (iii)dividing, using the one or more isolated computers, at least one of theone or more private keys for each digital asset account into a pluralityof private key segments, wherein each private key segment will bestored; (iv) associating, using the one or more isolated computers, eachof the plurality of private key segments with a respective referenceidentifier; and (v) transmitting, from the one or more isolatedcomputers to one or more writing devices operatively connected to theone or more isolated computers, electronic writing instructions forwriting a plurality of cards, collated into a plurality of sets havingonly one private key segment per digital asset account, and each cardcontaining one of the plurality of private key segments along with therespective associated reference identifier. The system can furthercomprise one or more writing devices located within the electronicisolation chamber and configured to perform the electronic writinginstructions, including collating the plurality of cards into theplurality of sets. The system can also comprise one or more readingdevices located within the electronic isolation chamber and configuredto read the plurality of private key segments along with the respectiveassociated reference identifier from the one or more cards. The readingdevices may be used for quality control, to ensure that the cards arereadable.

Cold Storage

In embodiments, a digital asset account holder may operate one or morecomputers to manage, process, and/or store the transactions and/ordigital assets. In embodiments, a portion, consisting of some or all, ofthe digital assets may be stored in cold storage, which involves nooutside connections. Cold storage may be a bank vault, a precious metalvault, a lockbox, or some other secure room or area. There may be nocommunication channels connecting to the cold storage area. Inembodiments, electronic vaults may be used. Electronic vaults maycomprise cloud storage, one or more hard drives, flash drives, memorycards or like storage technology, to name a few. Electronic vaults mayhold one or more keys and/or key segments, which may be encrypted and/orencoded as described herein.

In embodiments, the cold storage may comprise a divided storage system.In a divided storage system, components or portions of components may bestored at multiple locations. Components may be at least digitalwallets, public and/or private keys, or assets.

FIG. 9A is a schematic diagram of a cold storage vault system inaccordance with exemplary embodiments of the present invention. Inembodiments, each private key to be stored in vaults 70 for cold storagemay be divided into one or more segments 80. In embodiments, eachsegment can be stored in a separate vault 70. In this manner, the riskof each of the segments 80 being reassembled into a complete key may bereduced due to the segregation of each piece of each key. Each vault maythen be located at different locations, e.g., Locations A, B, and C. Inembodiments, each vault (e.g., 70-Aa, 70-A2, 70-A3) may be located atdifferent locations in the same general vicinity (e.g., the generalvicinity of Location A, which may be New York City). Each vault may havea user entry log to provide a record of access to the vault and/or mayemploy security measures to ensure only authorized access.

Duplicate sets of the segmented private keys may then be made and storedin separate vaults (e.g., one duplicate copy divided between Vaults70-B1, 70-B2, and 70-B3, and another duplicate copy divide betweenVaults 70-C1, 70-C2, and 70-C3). Each set of segmented keys 80 may belocated in the same general vicinity (e.g., Location B for Vaults 70-B1,70-B2, and 70-B3 and Location C for Vaults 70-C1, 70-C2, and 70-C3),with each general vicinity being different from other general vicinities(e.g., Location B may be Philadelphia and Location C may beIndianapolis, Ind.). Locations may include domestic and/or internationallocations. Locations can be selected based on at least one or more ofthe following parameters: ease of access, level of security, diversityof geographic risk, diversity of security/terror risk, diversity ofavailable security measures, location of suitable vaults in existence(e.g., custodian vaults for a trust associated with an ETP), spaceavailable at vaults, jurisdictional concerns, to name a few. Inembodiments, three geographic locations can be used wherein Location Ais within a short intraday time of transit (e.g., 1 hour), Location B iswithin a longer intraday time of transit (e.g., 3-4 hours), and LocationC is within one or more day times of transit (e.g., 1-2 days). Inembodiments, the location of the vaults may be within a distance thatallows segments of key pairs to be retrieved within a redemption waitingperiod (e.g., 3 days). A complete key set (e.g., stored private keysparts 1-3) may be stored in each vault general location (e.g., LocationA, Location B, Location C).

In FIG. 9A, three segments have been used, but other numbers of segmentscan also be used consistent with embodiments of the present inventions.FIG. 9B illustrates that any number of vault general locations (e.g.,A-N) may be used, which may entail n number of complete key sets. Inembodiments, the keys may be broken into any number of key segments,1-N. In embodiments, in order to reassemble one complete key, all Nsegments may have to be reassembled together.

In embodiments, there may be two sets of segmented keys, as illustratedin FIG. 9C, which may be located in two general locations (e.g., A andB). In embodiments, the keys may be parsed into two segments (e.g., 80-1and 80-2), as illustrated in FIG. 9C.

In embodiments, duplicate sets may not be embodied in same form as theoriginal set and/or other duplicate sets. For example, two sets may bestored on paper, and a third set is stored on papyrus. In embodiments,at least one set of segmented keys can be stored on paper, while atleast one set is stored on one or more disks, memory sticks, memorycards, tapes, hard drives, or other computer readable media. Inembodiments, the same number of segments can be used for each set. Inembodiments, a different number of segments can be used for at least twoof the sets (e.g., 3 segments for 1 set, and 4 segments for 1 set). Inembodiments, different types of coding and/or encryption can be used forat least two sets. FIG. 9D illustrates three sets of key copies, wherethe third copy 80 stored in vault 70-C may not be divided into segments.Such a key copy may be encrypted like any of the other key segments.

A cold storage back-up may be provided by a one-way electronic datarecordation system. The system can function as a write-only ledger. Upondeposit of digital assets into cold storage, the corresponding privatekeys may be transmitted to the recordation system, which will store arecord of the transaction. When digital assets are removed from awallet, a record of the removal and/or wallet destruction can be sent tothe system. In the event that wallet keys must be retrieved, therecordation system can be accessed to determine the wallet keys.Accessing the recordation system to retrieve keys can be designed to bea difficult operation, only to be performed in the event of an emergencyneed to recover wallet keys.

Key Storage Service

Digital asset storage services and/or digital asset protection may beprovided in accordance with the present invention. Digital asset storagemay use any of the secure storage systems and methods described herein,including those described with respect to a digital asset ETP. Inembodiments, a digital asset storage service may be provided to otherentities (e.g., a trust associated with an ETP, authorized participantsin the trust, retailers, banks, or other digital asset users), toprovide secure storage of digital assets. Such a storage service may useany of the security measures described herein. In embodiments, a digitalasset storage service may comprise, form a part of, and/or be associatedwith a digital asset insurance system, as described herein.

Digital asset protection can be digital asset insurance and/or digitalasset warranties. Digital asset insurance may be insured key storage,which may entail secure storage of one or more keys, such as privatekeys, where the secure storage service may guarantee the return of thestored private key and will pay out some amount if the key cannot bereturned. In embodiments, a digital asset warranty can be a warrantyagainst key loss, which may be a warranty against key loss by a digitalasset storage service.

A digital asset storage service and/or a digital asset protection systemmay be associated with and/or accessed through one or more digitalwallets. In embodiments, digital asset protection and/or storageservices may only be available when using a particular digital assetwallet and/or when employing particular storage mechanisms orprocedures. In embodiments, a digital wallet may provide an option torequest and/or accept protection and/or an option to request and/oraccept storage of one or more keys associated with the wallet. Inembodiments, a wallet may prompt and/or require a user to store theprivate key of the wallet, e.g., using the secure digital asset storageservice.

FIG. 10A illustrates an exemplary system for providing secure digitalasset storage and/or protection. A storage computer system 3320 maystore in computer-readable media or otherwise be connected to one ormore databases containing data 3335 relating to one or more digitalasset or key storage policies. In embodiments, data 3335 can alsoinclude information relating to a stored or insured digital wallet, suchas public keys, public addresses, and/or key storage information, whichmay comprise identification codes or other indicators of where keys orkey segments are stored. The storage computer system 3320 may store keydata 3325 in internal or external computer-readable memory comprisingone or more databases. Key data 3325 can include public key data,information identifying a key owner or wallet owner, information (e.g.,an identifying code) identifying or correlating a wallet's keys or keysegments, and/or information identifying location and/or retrievalinformation for stored keys or key segments, to name a few.

The exemplary system illustrated in FIG. 10A can include a plurality ofsecure storage locations, such as vaults 3305-1, 3305-2, and 3305-3.Private keys or key segments 3310-1, 3310-2, and 3310-3 may be stored ineach vault in accordance with the secure storage systems and methodsdiscussed herein, such as cold storage vaulting in different locations.Vaults may be connected to a network 15 at times and disconnected atother times. The network 15 may be any data network or a plurality ofconnected networks, internal, such as an intranet, or external, such asthe Internet. A plurality of keys corresponding to a multi-key walletmay be stored in separate vaults. In embodiments, one or more keys maybe divided into segments, which can be stored in separate vaults. Keysmay be divided whether from single private key wallets or multi-keywallets.

One or more users 3315 may be, e.g., customers and/or claimants of adigital asset storage and/or protection system. Users 3315 may obtainkey storage for one or more digital wallets containing digital assets inone or more denominations. Users 3315 may access or otherwiseparticipate in a digital asset storage and/or protection system usingone or more user device. In embodiments, the same digital wallet may beaccessed from a plurality of user devices using the same keycombinations (e.g., private and public keys).

FIG. 10B shows another exemplary embodiment of a system for providingsecure digital asset storage and/or protection. A plurality of vaults3305-1 to 3305-N may be employed to store keys or key segments insegregated locations. In embodiments, vaults may be secure locations,such as safety deposit boxes, bank vaults, rooms with controlled access,to name a few. Vaults may be physical and/or electronic repositories forkeys or key segments. In addition, each vault may have one or morebackups 3355 (e.g., Q number of backups for vault 3305-1, R number ofbackups for vault 3305-2, and S number of backups for vault 3305-N).Vault backups may be other vaults or other secure storage facilities,units, or devices. Vault backups may utilize the same or different typesof storage from each other and/or from the primary vault. For example, aprimary vault may include printed paper copies of keys or key segmentsstored in a bank lockbox, while a backup may comprise an offlineencrypted hard drive storing data corresponding to keys or key segments.Vault backups 3355 can be any of physical storage of printed ortranscribed keys or key segments, remote cloud storage, hard drive,disk, CD, DVD, memory card, flash drive, tape drive, and/or tapelibrary, to name a few.

Storage of Keys by a Digital Asset Storage Service

As discussed herein, a digital asset storage service may be provided tousers of a digital asset network to provide secure storage of digitalassets. In embodiments, the secure storage service may be used inconjunction with a digital asset protection plan, such as an insuranceor warranty plan, although the storage service may also be used withoutinsurance or warranties. FIGS. 11A-11B describe exemplary processes forstoring private keys, which may be used solely as a key storage serviceor in conjunction with protection plans, such as insurance or warrantyplans.

In embodiments, a user of a digital asset network may provide one ormore keys or key segments to the key storage service for storage. Keysor key segments may be provided to the storage service via email orother electronic data transfer, any of which may be secure or otherwiseencrypted. A user may use software to generate a wallet with one or moreprivate keys and/or to divide the keys into segments. The software mayinclude the ability to transmit, e.g., via a secure connection, the keysor key segments to the secure storage company. In embodiments, keys maybe delivered to a key storage company in person, via mail, or via fax.Such keys may be stored in accordance with the secure and cold storagevault security mechanisms discussed herein, which may include dividingthe keys into segments if not already divided.

Keys may also be generated at the secure storage company, e.g., at thesecure storage site. Accordingly, a user may log into a website orotherwise connect to a portal for accessing wallet generation software.Such software may be running on one or more processors located at thesecure storage company. The user may use the wallet generation softwareto create a wallet with one or more private keys. The user may also usesuch software to split one or more keys into key segments. Each key orkey segment may then be printed, transcribed, or otherwise prepared forstorage. In embodiments, the software may be programmed to transmit eachkey or key segment to a different printer, printing device, orelectronic storage device, any of which may be located in differentrooms, on different premises, in different geographies, and/or inseparate vaults, to name a few. Thus, the key storage service may thenstore each key or key segment in separate locations, in accordance withthe secure storage mechanisms discussed herein, such as the cold storagevault systems. Accordingly, the key storage company may never haveaccess to an assembled key or to the required plurality of keys to amulti-key wallet.

Upon a user's request for retrieval of a stored key or keys, the securekey storage company may send to the user originals or copies, physicallyor electronically, of the keys or key segments. In embodiments, the keystorage company may never reassemble keys or access a digital walletitself. The secure key storage company may charge fees at setup and/orat retrieval, as well as recurring storage fees.

FIG. 11A describes an exemplary embodiment of a process for secure keystorage and arranging for insurance or warranties against lost privatekeys, which process may be performed using a digital asset storagesystem, as discussed herein. The digital asset storage system maycomprise and/or form a part of a digital asset protection system. FIG.11A refers to the storage of private keys, but the process may apply tothe storage of both private and public keys.

FIG. 11A is a flow chart of an exemplary process for securely storingprivate key information, which may be performed by a secure digitalasset storage system. In a step S3422, a request to store a private keymay be received at the secure digital asset storage system. Inembodiments, such a request may comprise a request for insured privatekey storage. Such a request may originate from one or more othercomputers or electronic devices, such as a mobile phone, digital assettransaction kiosk, and/or personal computer, to name a few.

In a step S3424, a user may provide identification information, whichmay be received at the storage system Identification information maycomprise any of a name, contact information (e.g., address, telephonenumber, e-mail address, to name a few), government ID information (e.g.,an image of a driver's license, a driver's license ID number, a passportnumber, to name a few), biometric information (e.g., a voice sample,current photograph, eye scan, fingerprint, to name a few), username,password, and/or one or more security questions, to name a few. Theidentification information may be provided by and/or correspond to therequestor of private key storage and/or the private key owner. Inembodiments, the digital asset insurance system may receive and/or storea user's identification information.

In a step S3426, the storage system may obtain a private key to bestored. The storage system may receive the key or fetch it, e.g., from auser electronic device, such as a mobile phone. In embodiments, thestorage system may also obtain a public key to be stored.

In a step S3428, the storage system may cipher the private key, asdescribed herein. In embodiments, the private key may not be cipheredbefore dividing it into segments. In other embodiments, the private keymay be encrypted.

In a step S3430, the digital asset storage system may divide theciphered private key into any number of segments. In the case of amulti-key wallet, the keys may not be divided into segments. However,keys to a multi-key wallet may be encrypted and/or ciphered.

In a step S3432, the storage system may encrypt each private keysegment. In embodiments, encryption and/or ciphering may occur onlybefore or only after dividing a key into segments. In embodiments, thekey segments may not be encrypted after the segments are created. Thekey segments may be ciphered or not processed further.

In a step S3434, the storage system may transfer each encrypted privatekey segment to a different electronic vault for storage. In embodiments,the vaults may not be electronic, and the key segments may be printed orotherwise transcribed on a physical substrate and stored in the vaults.Any number of vaults may be used (e.g., one vault for each key segment,multiple vaults for redundant copies of each key segment, one or morevaults with two or more key segments stored together, to name a few). Acode, such as a bar code or QR code, may be provided along with the keysegments (e.g., printed with a physically transcribed copy of a keysegment electronically saved with an electronic key segment, or appendedto an electronic key segment, to name a few). The code may identify thekey segments (e.g., which key segments are part of the same key) and/orthe order of the key segments.

In a step S3436, the storage system may store, in one or more databases,key storage plan information (e.g., a subscription for key storagecosting $1.99/month), user identification information, private keysegment vault location information, and decryption and decipheringinstructions. The databases may be computer-readable databases orphysical (e.g., paper) databases that may be scanned and then read byone or more computers. In embodiments, the stored information may besent to a user and/or an storage system administrative coordinator,which may be a computer that can handle retrieval of stored keys.

In a step S3438, the digital asset storage system may send confirmationof private key storage (e.g., over a data transfer network) to the user(e.g., requestor of private key storage or other person associated withthe received identification information) and/or a third party.Confirmation of storage may be recorded by the storage system and/oranother entity associated with the storage system.

FIG. 11B illustrates that physical back-ups of the secured private keymay be employed by a secure digital asset storage system. In a stepS3442, a request to store a private key may be received at the storagesystem.

In a step S3444, the storage system may receive user or digital walletowner account identification information.

In a step S3446, the storage system may obtain (e.g., receive or fetch)a private key.

In a step S3448, the storage system may cipher the private key. Inembodiments, no ciphering may occur before dividing the key intosegments.

In a step S3450, the storage system may divide the private key (orciphered private key) into segments.

In a step S3452, the storage system may cipher each private key segment.

In a step S3454, the storage system may print each ciphered private keysegment. One or more copies of the key segments may be printed and/orotherwise transcribed onto any substrate and/or multiple substrates(e.g., paper, plastic, metal, to name a few). A code, such as a QR codeor bar code, may be used to identify corresponding key segments and/orthe order of the key segments. Such a code may be printed or otherwiseprovided with the key segments.

In a step S3456, the digital asset storage system may store eachciphered private key segment, as discussed herein. The key segments maybe stored in electronic vaults (e.g., hard drives, tape drives, solidstate memory, to name a few). Separate vaults may be used for each keysegment, although multiple key segments corresponding to multipledifferent private keys may be stored in the same vault.

In a step S3458, the storage system may store each printed key segmentin a physical vault, which may be separate vaults for each key segment.

In a step S3460, the storage system may store, in one or more databases,key storage plan information, user identification information, privatekey segment vault location information, deciphering instructions, anddecryption instructions, where applicable.

In a step S3462, the storage system may send confirmation of private keystorage to the user.

Recovering Stored Keys from a Digital Asset Key Storage Service

A user of a secure storage service or system may request access to astored key, which may be a means of recovering a lost key.

FIG. 12A is a flow chart describing an exemplary process for recoveringa key, which may be performed by one or more computers. In embodiments,the process may entail recovering (e.g., retrieving from storage) aplurality of keys or key segments.

In a step S3502, a user may submit a claim for a lost private key, whichmay be received by a computer system of a secure storage service storinga copy of the user's private key. A claim may be a request for retrievalof one or more stored keys.

In a step S3504, the storage system, using the computer system, maycorrelate the received claim to one or more locations where private keysegments are stored. For example, the computer system may access adatabase of policy information to determine where (e.g., in whichvaults) a claimants keys or key segments are stored.

In a step S3506, a message, which may constitute instructions, may betransmitted to one or more storage facilities to retrieve the privatekey segments. A computer system may automatically generate such amessage based upon the information pertaining to stored keys or keysegments. Such a key retrieval message can include a security code orother authorization to access a secure storage location. In embodiments,the computer system may employ security measures, such as a secure codeor digital signature, to provide verification and/or authentication of aretrieval message.

In a step S3508, the private key segments may be verified. Keys or keysegments may be retrieved from their respective storage locations.Quality control measures may verify that the correct key segments wereretrieved and/or that the keys or key segments are readable, e.g., by aspecially programmed scanning device, such as a QR scanner.

In a step S3510, the private key segments may be transmitted to a deviceand/or account corresponding to the user. One or more securetransmissions may be used. Two-factor authentication may be required ofthe recipient before a transmission is sent and/or opened by therecipient. In embodiments, the system may decrypt, reassemble, and/ordecipher private keys and/or key segments before returning the keysand/or key segments to a user. In embodiments, a user may be providedwith the option of having the system perform the decrypting,reassembling, and/or deciphering steps. In embodiments, software may beprovided to a user to enable such steps to be performed by a user orunder a user's control. In embodiments, the computer system may neverdecrypt keys or key segments that were encrypted by a user. Accordingly,in step S3510, the user may be provided with key segments and/orreassembled keys, which may be in various states of security (e.g.,ciphered, segmented, and/or encrypted).

In a step S3512, the system may receive confirmation that the userreceived the private keys or key segments. A user device mayautomatically generate and/or transmit a confirmation upon receipt ofthe keys or key segments, upon reassembling thereof, upon opening acorresponding digital asset wallet, or upon instruction for a user, toname a few. Such confirmation may provide an indication that the securestorage service and/or protection service met its obligation, e.g., tothe customer.

FIG. 12B illustrates another exemplary process for recovering a key.Such process may be performed by one or more computers. The process maybe considered the same as the process of FIG. 12A, except with theaddition of a user authentication step S3524.

Thus, in a step S3522, a user may submit a claim for a lost private key,which may be received by a secure storage service storing a copy of theuser's private key.

In a step S3524, the secure storage system may authenticate the identityof the claimant. Authentication may involve any of receipt of any of auser's identification information, such as name, username, password,biometric information, or the like. In embodiments, three forms ofidentification information may be required. In embodiments, a claimantmay receive a phone call, which may be auto-generated and auto-executedby the system, which may provide the claimant with a code to input at auser device. In embodiments, the user may be required to repeat aphrase, which may be a unique phrase. Voice analysis and/or recognitiontechniques may be employed. The user may be required to submit a currentpicture or video. The system may compare the received identificationinformation to a database of authorized user identification informationin order to authenticate the identity of the claimant.

In a step S3526, the system may correlate the received claim to one ormore locations where private key segments may be stored.

In a step S3528, a message, which may constitute instructions, may betransmitted to one or more storage facilities to retrieve the privatekey segments.

In a step S3530, the private key segments may be verified.

In a step S3532, the private key segments may be transmitted to a deviceand/or account corresponding to the user. In embodiments, decryption,reassembly, and or deciphering of private keys and/or key segments mayoccur before or after returning the keys and/or key segments to a userand may be performed by the system or by a user, who may use softwareprovided by the system.

In a step S3534, the system may receive confirmation that the userreceived the private key segments.

Another exemplary process for recovering a key is provided in FIG. 12C.Such process may be performed by one or more computers. The process maybe considered the same as the process of FIG. 12B, except with theaddition of steps to check the account balance of the account and adetermination step of whether to proceed with the key retrieval.

Thus, in a step S3542, a user may submit a claim for a lost private key,which may be received by a secure storage service storing a copy of theuser's private key.

In a step S3544, the secure storage system may authenticate the identityof the claimant, in manners described for step S3524 of FIG. 12B.

In a step S3546, the system may check the account balance of theaccount.

In a step S3548, the system may determine whether to proceed with therequested key retrieval. In embodiments, retrieval may be halted if anaccount balance is above a threshold or below a threshold.

In a step S3550, the system may correlate the received claim to one ormore locations where private key segments may be stored.

In a step S3552, a message, which may constitute instructions, may betransmitted to one or more storage facilities to retrieve the privatekey segments.

In a step S3554, the private key segments may be verified.

In a step S3556, the private key segments may be transmitted to a deviceand/or account corresponding to the user of the account. In embodiments,decryption, reassembly, and or deciphering of private keys and/or keysegments may occur before or after returning the keys and/or keysegments to a user and may be performed by the system or by a user, whomay use software provided by the system.

In a step S3558, the system may receive confirmation that the userreceived the private key segments.

ETP

In embodiments, an ETP can be provided using a digital math-based asset,such as bitcoins, Namecoins, Litecoins, PPCoins, Tonal bitcoins,IxCoins, Devcoins, Freicoins, I0coins, Terracoins, Liquidcoins,BBQcoins, BitBars, and PhenixCoins, to name a few. An ETP may be aspecial purpose entity, statutory trust, business trust, or othercorporate form established under the laws (e.g., of a state of theUnited States) that continuously issues and/or redeems its shares inexchange for a portfolio of specified assets, such as digital assets,currencies, physical commodities, securities and/or other assets. TheETP may issue equity securities which it may register with the USSecurities and Exchange Commission. The ETP may list the equitysecurities for trading in the secondary market at intraday prices on astock exchange. Each issued share of an ETP may represent a ratableundivided interest in its underlying portfolio of assets. Inembodiments, shares of an ETP may be created only in large blocks or lotsizes, such as creation units. In embodiments, only large marketparticipants may be authorized participants (“APs”) who may obtaincreation units in exchange for a deposit of a specified amount of assetsinto the ETP's portfolio. APs may hold or sell into the secondary marketthe individual shares comprising the creation units issued.

In embodiments, an AP can be a person or entity who is a registeredbroker-dealer or other securities market participant such as a bank orother financial institution which is not required to register as abroker-dealer to engage in securities transactions, is a participant ina third-party clearing agency, such as the DTC, has entered into anAuthorized Participant Agreement with the trustee and the sponsor,and/or has established an AP custody account. In embodiments, only APsmay place orders to create or redeem one or more baskets of trustshares. For example, a basket of shares can be a block of 10,000 shares,20,000 shares, 30,000 shares, 40,000 shares, 50,000 shares, 75,000shares, 100,000 shares, and/or some other denomination of shares.

In embodiments, an Authorized Participant Agreement can be an agreemententered into by an AP, the sponsor and/or the trustee which provides theprocedures for the creation and redemption of baskets of trust sharesand for the delivery of the digital math-based assets, e.g., bitcoins,Namecoins, Litecoins, PPCoins, Tonal bitcoins, IxCoins, Devcoins,Freicoins, I0coins, Terracoins, Liquidcoins, BBQcoins, BitBars, andPhenixCoins, required for such creations and redemptions.

In embodiments, an AP custody account can be a segregated account fordigital math-based assets, e.g., a segregated bitcoin account, owned byan AP and established with the trustee and/or custodian by an AuthorizedParticipant Custody Account Agreement. An AP custody account can be usedto facilitate the deposit and withdrawal of digital math-based assets,such as bitcoins, Namecoins, Litecoins, PPCoins, Tonal bitcoins,IxCoins, Devcoins, Freicoins, I0coins, Terracoins, Liquidcoins,BBQcoins, BitBars, and PhenixCoins, to name a few, by an AP in creationand redemption processes, as discussed herein by way of example withrespect to FIGS. 17A-B and 19A-C.

In embodiments, an Authorized Participant Custody Account Agreement canbe the agreement between an AP and the trustee which can establish an APcustody account.

In embodiments, in order to initiate the issuance of shares, an AP mayplace a creation order with the trustee and/or administrator of the ETP.Upon the trustee's acceptance of the order, the trustee and/oradministrator, using the trust computer system, may notify the AP of theexact amount or quantity of portfolio assets that is required to bedeposited into the ETP's account in exchange for one or more creationbaskets, which are valued at their current net asset value. Inembodiments, the trustee and/or administrator may hold the ETP'sportfolio assets on behalf of all shareholders. In embodiments, thetrustee and/or administrator may be authorized to make transfers fromthe trust account to third parties only under certain specificcircumstances, such as to pay for the ETP's permitted operationalexpenses or to redeem creation units tendered for redemption by an AP. Aredemption of creation units may be the reverse of a creation; the APmay place a redemption order with the trustee. Upon the trustee's and/oradministrator's acceptance of the order, the AP may tender to thetrustee the stated number of creation units for redemption and inexchange may receive the pro rata amount or quantity of portfolio assetsrepresented by such shares. The trustee and/or administrator may thencancel and/or instruct a third party clearing agency (e.g., DTC) tocancel all shares comprising the creation units so delivered. Thiscontinuous issuance and redemption feature of an ETP provides anarbitrage mechanism for APs, who may either create or redeem creationunits when the current trading price of the individual shares on thesecondary market deviates from the underlying net asset value of suchcreation units, thereby reducing such deviation between the tradingprice and the underlying net asset value.

In embodiments, the trust may have an investment objective for shares toreflect the performance of a blended price of digital math-based assets,e.g., a blended bitcoin price of bitcoins, less expenses of the trust'soperations. The shares can be designed for investors who want acost-effective and convenient way to invest in digital math-based assetswith minimal credit risk.

In embodiments, the trust can directly hold digital math-based assets,such as bitcoins, Namecoins, Litecoins, PPCoins, Tonal bitcoins,IxCoins, Devcoins, Freicoins, I0coins, Terracoins, Liquidcoins,BBQcoins, BitBars, and PhenixCoins, using the trust's hardware and/orsoftware security system, which in embodiments may include storage ofthe trust's digital assets and/or the private keys relating to thedigital wallets holding the trust's digital assets in one or morelocations in, for example, high security vaults.

In embodiments, the trust may hold any combination assets, includingdigital math-based assets, physical commodities, securities and/or otherassets. A trust agreement may specify and/or limit which assets aparticular trust may hold.

ETP Participants

As illustrated in FIG. 13, in exemplary embodiments, an ETP may includeone or more participants, such as one or more market makers 205,purchasers 210, trustees 215, custodian 220, administrator 225, sponsor230, listing exchange 235, calculation agent 240, marketing agent 245,third-party clearing agency 250 (e.g., the DTC or NSCC), attorneys 255,accountants 260, and/or authorized participants 265, to name a few. Inembodiments, one or more of these roles may be performed by the sameentity (e.g., the same entity may be the custodian and theadministrator). In embodiments, more than one entity may perform thesame role or part of a role, such as more than one market maker may beused for the same ETP. Various combinations of entities can be usedconsistent with exemplary embodiments of the present invention.

In embodiments, an ETP may involve an underlying trust and one or moreof the entities discussed herein. FIG. 13 provides an overview of atleast some of the possible participants in an ETP. A sponsor 230 mayestablish the ETP, which generally may be established as a common law orstatutory trust under state law. One trust may be created or multipletrusts for different ETPs may be established at one time. A single trustestablished as a series trust may also create multiple series fordifferent ETPs. The sponsor 230 may have contractual rights involvingthe trust. The sponsor 230 may pay SEC registration fees and may provideseed capital for the trust, to name a few. Additionally, the sponsor 230may prepare, sign, and/or file trust registration statements and/orother formation documents, periodic SEC reports, and/or registrationstatement updates. The sponsor 230 may create free-writing prospectusesand other promotional materials about the trust and may file suchmaterials with the SEC, as required by government regulation. Thesponsor 230 may participate in marketing activities for the trust, suchas road shows. The sponsor 230 may maintain the trust's public websitefor viewing by the holders of the trust's securities, prospectivepurchasers of its shares, and/or any entity desirous of viewing thetrust's public website.

An initial purchaser 210 may provide seed capital to the trust inexchange for a set number of creation units of the same value. A marketmaker 205 may undertake to buy or sell creation units in the trust atspecified prices at all times.

A custodian 220 can safe keep the trust's assets and can engage one ormore sub-custodians to do so in different locations. In embodiments, theone or more sub-custodians may comprise different entities. Inembodiments, the one or more sub-custodians may comprise differentaspects of the same entity or may be affiliated entities. A custodian220 may hold copies of segmented private keys in one or more vaults.

An administrator 225 can keep books and records for the trust, conductother ministerial duties and/or may calculate the trust's daily netasset value, daily share price, and/or other pertinent information aboutthe trust, the trust's assets, and/or the trust shares.

The trustee 215, the custodian 220 and/or the administrator 225 may bethe same person or entity, may be different operations of the sameperson or entity, may be different persons or entities, or may bemultiple persons or entities performing the same and/or overlappingfunctions.

A listing exchange 235 is a venue where shares registered with the SECmay be listed and traded during business days. The listing exchange 225can track using one or more computers and publish electronically usingone or more computers an estimated intraday indicative value (“IIV”) ofa trust regularly, e.g., every 15 seconds. A calculation agent 240 usingone or more computers may also perform daily calculations of trustassets using methods known in the art and may provide the IIV. Thetrustee 215 and/or the administrator 225 may also serve as thecalculation agent 240 and may be the same person and/or entity,different operations of the same person and/or entity, and/or may bedifferent persons.

A marketing agent 245 may also be engaged to provide services to thetrust relating to the public marketing of its shares for sale. Themarketing agent 245 may review marketing documents for regulatorycompliance, e.g., rules of the Financial Industry Regulatory Authority(“FINRA”) and/or relevant regulatory authority. The marketing agent mayfile the trust's marketing materials with FINRA and/or relevantregulatory authority.

The processes of clearance and settlement of trust shares may beperformed by a clearing agency or a registered third-party entity 250,such as the Depository Trust Company (“DTC”) and/or the NationalSecurities Clearing Corporation (“NSCC”). Shares may be available onlyin book-entry form, meaning that individual certificates may not beissued for the trust's shares. Instead, shares may be evidenced by oneor more global certificates that the trustee may issue to a clearingagency or a registered third-party entity 250, e.g., DTC. The globalcertificates may evidence all of the trust's shares outstanding at anytime. As a result, in embodiments, shares may be only transferablethrough the book-entry system the third-party clearing agency 250.Shareholders may hold and/or transfer their shares directly through thethird-party clearing agency 250, if they are participants in theclearing agency 250, or indirectly through entities that areparticipants in the clearing agency 250 (e.g., participants in DTC).Transfers may be made in accordance with standard securities industrypractice.

An index provider 270 may license its intellectual property to the trustfor pricing, portfolio selection, and/or other services, and may, usingone or more computers, calculate and/or upkeep the index during the termof the license. In embodiments, for example, an index of digital assetvalues (such as bitcoin values) or blended digital asset prices (such asblended bitcoin prices) may be used to price the digital assetstransferred to and/or from the trust and/or held by the trust. Otherforms of valuation of the digital assets (such as bitcoins) can also beused as discussed herein.

Lawyers 255 and accountants 260 may provide services to the sponsor 230and/or the trust and/or other participants in the trust.

In embodiments, transactions with the trust may be restricted to one ormore APs 265. The trust may establish requirements for becoming an AP,e.g., must be an entity of a certain size, financially or otherwise,must be a large market investor, like a broker-dealer and/or a bank,must seek and obtain formal approval from the trustee, must enter intoan agreement with the trustee and/or other such requirements known inthe art, to name a few. In embodiments, APs may be broker-dealers and/orbanks. APs may enter into an AP agreement with the trust and/or thesponsor 230, which may include rules for the issuance and/or redemptionof creation units. Depending on the nature of the trust's intendedassets, an AP may be required to hold and deliver specific commodities,e.g., a digital math-based asset, directly to the trust.

In embodiments, a trustee 215 may be generally responsible for theday-to-day administration of the trust. A trustee 215 (or its designee,such as the custodian 220 and/or administrator 225) may perform one ormore of the following tasks associated with the trust:

-   -   establishing and/or having established, using one or more        computers, wallets for digital math-based assets (e.g.,        bitcoins, Namecoins, Litecoins, PPCoins, Tonal bitcoins,        IxCoins, Devcoins, Freicoins, I0coins, Terracoins, Liquidcoins,        BBQcoins, BitBars, and PhenixCoins, to name a few) to be used by        the trust associated with an ETP holding such digital math-based        assets (e.g., bitcoins, Namecoins, Litecoins, PPCoins, Tonal        bitcoins, IxCoins, Devcoins, Freicoins, I0coins, Terracoins,        Liquidcoins, BBQcoins, BitBars, and PhenixCoins, to name a few);    -   establishing and/or having established, using one or more        computers, digital wallets for custody and other accounts to be        used on behalf of participants in the trust, e.g., AP custody        accounts 315, sponsor custody accounts 310, trust custody        accounts 300, trust expense account 305, and/or vault accounts        320, to name a few;    -   transferring and/or having transferred, using one or more        computers, digital math-based assets from and/or to one or more        digital wallets associated with one or more digital wallets        associated with one or more accounts, including AP custody        accounts 315, trust custody accounts 300, trust expense accounts        305, sponsor custody account 310, and/or vault accounts 320, to        name a few;    -   determining and/or having determined, using one or more        computers, expenses and fees to be paid by the trust, including,        e.g., sponsor fees, legal fees, accounting fees, extraordinary        expenses fees, and/or transaction fees, to name a few;    -   paying and/or having paid, using one or more computers, expenses        and fees to be paid by the trust, including, e.g., sponsor fees,        legal fees, accounting fees, extraordinary expenses, and/or        transaction fees, to name a few;    -   calculating or having calculated, using one or more computers,        an ANAV, an ANAV per share, a NAV, and/or a NAV per share;    -   receiving and/or processing, using one or more computers, orders        from APs to create and/or redeem creation units and/or baskets        and/or coordinating the processing of such orders with a        clearing agency or a registered third-party entity 250;    -   transferring and/or having transferred and/or facilitating        transfers, using one or more computers, of digital math-based        assets of the trust as needed into and/or out of custody        accounts and/or vault accounts to cover redemptions and/or to        pay expenses and fees to be paid by the trust, including, e.g.,        sponsor fees, legal fees, accounting fees, extraordinary        expenses fees, and/or transaction fees, to name a few;    -   selling and/or arranging for sale remaining digital math-based        assets of the trust at termination of the trust and/or        distributing the cash proceeds to the shareholders of record;    -   supervising and/or arranging for the supervision of the        safekeeping of the digital math-based assets deposited with the        trust by APs in connection with the creation of creation units        and/or baskets;    -   administering and/or having administered and/or maintaining        and/or having maintained custody accounts on behalf of the        trust, APs, the sponsor and/or others;    -   administering and/or having administered and/or maintaining and        or having maintained and/or supervising the maintenance, upkeep        and/or transfer of private key information to and/or from        vaults; and/or    -   generating and/or having generated, using one or more computers,        encryption, splitting, QR coding (or other bar coding) and        printing the paper tokens, to name a few.

As described in greater detail herein with respect to FIGS. 5 and 17, anAP may provide assets to the trust in exchange for shares in the trust,and an AP may redeem shares in the trust for assets.

Secondary Market Activities

FIG. 14 is a schematic diagram of an exemplary secondary market forshares in the trust in accordance with exemplary embodiments of thepresent invention. In embodiments, the secondary market can include oneor more listing stock exchanges 235 (e.g., NYSE, NASDAQ, AMEX, LSE, toname a few), one or more market makers 205, one or more brokers and/orother licensed to sell securities 400, authorized participants 265,other market liquidity providers 405, individual investors 410,institutional investors 420 and private investors 430, to name a few.

As described earlier, in the primary market APs 265 may obtain and/orredeem shares in the trust through the creation and redemption redeemprocesses. APs 265 may then sell shares in a secondary market. APs 265may also buy shares in the secondary market. In an exemplary secondarymarket for shares in the trust for a digital math-based asset ETP, e.g.,a Bitcoin ETP, a listing stock exchange 235 may be the primary listingvenue for individual ETP shares. In embodiments, the listing stockexchange 235 may be required to file listing rules with the SEC if noapplicable listing rules already exist. The listing exchange 235 mayenter into a listing agreement with the sponsor 230. In embodiments, thelisting exchange 235 may appoint the lead market maker and/or othermarket makers 205. The market makers 205 may facilitate the secondarymarket trading of shares in the trust underlying the ETP. Market makers205 may facilitate creations and/or redemptions of creation unitsthrough one or more APs. In embodiments, such creations and/orredemptions may be related to market demand, e.g., to satisfy marketdemand.

Still referring to FIG. 14, individual investors 410, institutionalinvestors 420, and/or private investors 430 may buy and/or sell one ormore shares in the trust. In embodiments, these investors may buy and/orsell shares through brokers 400 or others licensed to sell securities.Brokers 400 and/or others licensed to sell securities may receive cashand/or other assets from investors in order to buy one or more shares inthe trust. Brokers 400 and/or others licensed to sell securities mayreceive one or more shares from investors to sell for cash and/or otherassets.

Other market liquidity providers 405 may also participate in thesecondary market. In embodiments, other market liquidity providers 405may buy and/or sell one or more shares on a list stock exchange 235. Inembodiments, other market liquidity providers 405 may buy and/or sellone or more creation units through one or more APs 265. Other marketliquidity providers 405 may include, by way of example, arbitragers,prop traders, “upstairs”, private investors, dark pools, to name a few.

ETP Setup

In an exemplary embodiment, the ETP may be based on an ownership stakein a digital asset investors trust, such as a Bitcoin investors trust. Atrust may be created as a common law trust or a statutory trust that mayelect, grantor trust status. It will be appreciated by those in the artthat other forms of trust are possible, including but not limited tomaster trusts, owner trusts, and revolving asset trusts. Such a trustmay register its shares with the SEC under the Securities Act of 1933,as amended, to sell shares to the public. A trust may hold portfolioassets that may require the sponsor or administrator of the trust toregister as a commodity pool operator under the Commodity Exchange Actwith the U.S. Commodity Futures Trading Commission (“CFTC”).

In embodiments, the trust's assets may be digital math-based assets,such as bitcoins, held in one or more digital wallets maintained byand/or for the trustee 215. Other forms of asset storage and securityare discussed herein. In embodiments, the trust assets can include otherforms of digital math-based assets, such as other forms of digitalassets, digital math-based assets, peer-to-peer electronic cash system,digital currency, synthetic currency, or digital crypto-currency.Exemplary digital assets can include bitcoins, Namecoins, Litecoins,PPCoins, Tonal bitcoins, IxCoins, Devcoins, Freicoins, I0coins,Terracoins, Liquidcoins, BBQcoins, BitBars, and PhenixCoins, to name afew. In embodiments, the trust's assets can include additional assetsbesides digital math-based assets, such as, other commodities,currencies, futures, derivatives, and/or securities, to name a few.

The trust's assets may be held in various forms of storage using any ofthe security systems and methods described herein. In embodiments, thetrust may employ a hardware and/or software security system to protectthe digital math-based assets, such as bitcoin assets. In embodiments,the trustee 215, the administrator 225, the custodian 220, and/or someother entity may perform operations related to creations and redemptionsfrom a secure administrative portal. In embodiments, digital assetaccounts and/or digital wallets may be created after a request for adeposit is made, at the time the trust's security measures are set up(e.g., 10,000 wallets created at the outset), at some intermediate pointduring the life of the trust, or at any other time where digital walletsare deemed necessary or desirous, e.g., to ensure that the amount ofassets in any given wallet remains below some threshold.

At set up of a trust, seed baskets and/or initial baskets may be issuedto one or more initial purchasers 210 in connection with the formationof the trust.

In embodiments, creations may involve the transfer of assets to thetrust, and redemptions may involve the withdrawal of assets from thetrust, as discussed herein. In embodiments, the trust may be passive,such as not actively managed, in which case it may be subject to theadditions or reductions in the asset inventory caused by creationsand/or redemptions. In embodiments, the trust may restrict issuanceand/or redemption of shares to creation units. In embodiments, creationunits may describe the specific number of shares that may be exchangedfor digital assets of the same value. Creation units may be lot sizes ofa pre-defined number of shares. In embodiments, creation units may belarge lot sizes of shares. For example, in embodiments, a creation unitmay be 10,000 shares, 20,000 shares, 30,000 shares, 40,000 shares,50,000 shares, 75,000 shares, 100,000 shares, and/or some otherdenomination of shares. In embodiments, the creation unit may be basedon some fractional amount of shares. In embodiments, a creation unit maycorrelate to a creation deposit (for creations) or withdrawal proceeds(for redemptions) that comprise a lot size of assets, securities, toname a few. For example, in embodiments a creation of 50,000 shares maycorrelate to a creation deposit of 10,000 digital assets (e.g.,bitcoins). In embodiments, a creation unit may correlate to a creationdeposit or withdrawal proceeds that comprise a lot size of fractionaldenominations of assets, e.g., 100 Satoshis, 200 Satoshis, 10,000Satoshis, or some other denomination of Satoshi.

In embodiments, one or more creation units may be created in a processin which one or more creation deposits is transferred to the trust inexchange for issuance a specified set number of shares in the fund,e.g., 50,000 shares. For a redemption, as described herein, an AP mayredeem one or more creation units in exchange for the related withdrawalproceeds and resulting in the cancellation of a corresponding set numberof shares. In embodiments, an AP may only transact in whole creationunits. Thus, the AP may only deposit assets equal to one or more wholecreation units. Similarly, the AP may relinquish shares amounting to oneor more whole creation units in order to redeem those creation units. Inembodiments, transactions involving fractional amounts of a creationunit may be allowed.

Transactions may occur on a daily basis. In embodiments, transactionsmay occur multiple times each day. In embodiments, the frequency oftransactions may be limited by rule so as to limit the number oftransactions, e.g., one transaction per week, three transactions in agiven month, to name a few. In embodiments, transactions may be limitedby rule to occurring during certain time periods, such as only on agiven day of the week (e.g., Mondays) or only on a given day of themonth (e.g., the first day of the month), after 3 P.M., to name a few.In embodiments, transactions may be limited to occurring on businessdays.

The trust may accept only a single commodity, currency or other asset.In embodiments, multiple types of commodities, currencies or assets maybe accepted, for example, like a basket currency model. Those in the artwill appreciate that the asset may be a commodity, currency and/or otherasset which may be physical, digital, or otherwise existing.

In embodiments, only an AP may obtain shares in the trust. Thus, in theprimary market for shares only APs can participate. However, in asecondary market, APs may sell or otherwise transfer shares in whatevermanner and for whatever consideration they choose. In embodiments, APsmay sell shares for cash and/or other remuneration. A shareholder canown beneficial interest in shares in the trust. In embodiments, an AP'sability to transfer shares may be limited by securities laws, FINRA,and/or corporate compliance procedures, to name a few. Shares in a trustmay include units of fractional undivided beneficial interest in andownership of a trust.

Administration of the trust may involve the use of one or more accounts,including one or more custody accounts. In embodiments, referring toFIG. 15A, such accounts may include AP custody accounts 315, trustcustody accounts 300, vault accounts 320, sponsor custody accounts 310,and/or trust expense accounts 305, to name a few.

A custody account can be a segregated account operated by the trustee onbehalf of another involved with the trust, e.g., sponsor or AP, to namea few. In embodiments, a custody account may be a digital wallet, adigital asset account, and/or a Bitcoin account. In embodiments, acustody account may be created, e.g., by the trustee, for each newtransaction, e.g., creation, redemption, payment of sponsor's fee, toname a few. Referring to the exemplary embodiment illustrated in FIG.15A, a trust custody account 300 may be owned by the trust. The trustcustody account 300 may be the primary holder of the trust's assets,e.g., bitcoins. In an exemplary embodiment of the present invention, thetrust custody account 300 may store public and private keys for one ormore digital wallets holding the trust's digital assets, e.g., bitcoins.In embodiments, referring to FIG. 15B, the trust custody account 300 maycomprise one or more temporary digital wallets 325 and/or one or morevault accounts 320. Vault accounts 320 may be digital wallets. Vaultaccounts 320 may be stored in a secure manner as discussed herein. Vaultaccounts 320 may be used for longer-term storage of digital assets.Temporary digital wallets 325 may be hot storage, which may be accountsand/or wallets that are accessed with greater frequency than vaultaccounts 320 in order to, for example, perform transactions. Inembodiments, the trust custody account 300 may be a segregated account,segregating the assets it holds from all other assets held by thecustodial operations of the trustee. The trust custody account 300 mayfacilitate the acceptance of creation deposits from an AP custodyaccount 315, the distribution of assets, e.g., bitcoins, to an AP aspart of a redemption, and/or the distribution of assets to a trustexpense account 305 and/or a sponsor custody account 310. The trustexpense account 305 may be owned by the trustee 215. In embodiments, atrust expense account 305 can be a segregated digital asset account,such as a segregated Bitcoin account, of the trustee 215 to which thetrustee can transfer digital assets, e.g., bitcoins, from a trustcustody account 300 in order to pay expenses of the trust not assumed bythe sponsor 230. A trust expense account 305 can be established with thetrustee 215 by a trust agreement.

In embodiments, trust expense account 305 may be used by the trustee 215to pay extraordinary expenses that have not been assumed by the sponsor230. Indirect payment of such expenses may occur when assets aredistributed to the trustee's trust expense account 305. The trustee 215may then sell or otherwise transfer assets from the trust expenseaccount in order to satisfy expenses. A sponsor custody account 310 maybe used to accept payments by the trust of a sponsor's fee. Inembodiments, payments may be made in digital math-based assets, such asbitcoins. Payment of the sponsor's fee may be a periodic, e.g., monthly,event. One or more AP custody accounts 315-1 . . . 315-N may be owned byone or more APs, 265-1 . . . 265-N. AP custody account 315 may be usedto receive deposits of assets from an AP for use in a creation, asdetailed in FIGS. 17A and 17B and/or may be used to receivedistributions of assets to an AP during a redemption, as detailed inFIG. 19A.

It should be appreciated by those of skill in the art that each of theseaccounts may be made up of one or more accounts, and/or one or moredigital wallets.

The trustee and/or administrator and/or custodian may use one or moretrust computers in performance of the processes and/or tasks describedherein. A trust computer system may be located at an administrativeportal. As illustrated in FIG. 16, a trust computer system may containexchange transaction data 500, which may, for one or more transactions(e.g., each transaction), store exchange data, currency data, time data,price data, and/or volume data, to name a few. A trust computer systemmay contain trust account data 510, which may, for one or more accounts,store account types, public keys, correlation numbers, private keysand/or private key IDs (which may indicate the location of storedprivate keys and/or key segments), transaction history data, and/oraccount balance data, to name a few. A trust computer system may alsocontain expense data 520 and/or fee data 530.

Still referring to FIG. 16, a trust computer system may contain ablended digital asset price module 540, a NAV module 545, an expensemodule 550, a creation module 555, a redemption module 560, a fee module565, an IIV module 570, a wallet module 575, a key parser module 580,and/or a key segment generator module 585, to name a few.

Investments Into ETP

In embodiment, the trust for the ETP can create and/or redeem sharesfrom time to time. In some embodiments, the creation and/or redemptionmust be in whole baskets, e.g., a block of a fixed number of shares,e.g., 50,000 shares. The creation and/or redemption of baskets canrequire, respectively, the delivery to the Trust or the distributionfrom the Trust of the number of bitcoins represented by the basketsbeing created and/or redeemed, the amount of which can be based on thecombined NAV of the underlying assets relating to the number of sharesincluded in the baskets being created and/or redeemed. In embodiments,an initial number of bitcoins required for deposit with the Trust tocreate Shares can be a fixed amount per basket. In embodiments, thenumber of bitcoins required to create a basket or to be delivered uponthe redemption of a basket may change over time, due to, e.g., theaccrual of trust's expenses, the transfer of the trust's bitcoins to paysponsor's fee and/or the transfer of the trust's bitcoins to pay anytrust expenses not assumed by the Sponsor, to name a few.

In embodiments, the number of whole and fractional bitcoins in thedeposit required for a basket (“Creation Basket Deposit”) may bedetermined by dividing the number of bitcoins held by the trust by thenumber of baskets outstanding, as adjusted for the number of whole andfractional bitcoins constituting estimated accrued but unpaid fees andexpenses of the trust. Fractions of a bitcoin smaller than a Satoshi(i.e., 0.00000001 of a bitcoin) which are included in the CreationBasket Deposit amount are disregarded in the foregoing calculation. Allquestions as to the composition of a Creation Basket Deposit will beconclusively determined by the Trustee. The Trustee's determination ofthe Creation Basket Deposit shall be final and binding on all personsinterested in the Trust.

In embodiments, baskets may be created and/or redeemed only by APs, suchas APs who pay a transaction fee for each order to create and/or redeemBaskets and/or have the right to sell the shares included in the Basketsthey create to other investors. In embodiments, the Trust may or may notissue fractional baskets.

In embodiments, a method for purchasing shares of a trust associatedwith an exchange traded product holding digital math-based assets maycomprise receiving, at a trust computer system from an AP computersystem, a request from an AP to purchase shares in the trust; providingor creating, at the trust computers system, one or more digital walletsassociated with a trust custody account to hold digital math-basedassets, each digital wallet have a respective public key and arespective private key; providing, from the trust computer system to theAP computer system, each respective public key; receiving, at the trustcomputers systems, into the one or more digital wallets a first amountof digital math-based assets, from one or more digital walletsassociated with an AP; sending, from the trust computer system to adigital asset network, an asset notification to provide for the assettransfer recorded on a public transaction ledger of a digital assetnetwork to reflect the transfer of the first amount of digitalmath-based assets; receiving, at the trust computer system, confirmationfrom the digital asset network, that the transfer is valid; and sendinginstructions to a third-party clearing entity to transfer a first amountof shares in the trust to the AP.

FIG. 17A is a flow chart of a process for investing in the trust inaccordance with exemplary embodiments of the present invention. Inembodiments, the process depicted in FIG. 17A may be performed by thetrustee, the administrator, the custodian, and/or one or more computersoperated by one or more of those entities or another entity. Inexemplary embodiments, in step S102, a request may be received from aprospective AP to become an AP and/or to purchase shares in the trust.At this point the prospective AP may be made an AP with the trust forthe ETP. In a step S104, authorization may be provided, e.g., from thetrustee, to purchase shares in the trust. In embodiments, step S104 maybegin a settlement process. In embodiments, the settlement process willcomprise a window, e.g., a 3-day window, during which an AP may hedgeits position in the market. In embodiments, the AP may obtain digitalassets amounting to a creation deposit to create the creation unit. Forexample, the AP may purchase bitcoins required for the creation deposit,or may otherwise have sufficient bitcoins, e.g., stored in a digitalwallet, to settle a creation unit order. In a step S106, the trustee maycreate one or more new digital wallets to receive assets from an AP. Ina step S108, the trust may receive assets, e.g., from an AP. Inembodiments, the assets may comprise one or more creation units. Inembodiments, the assets may be deposited by the AP directly into an APcustody account. Where assets are not deposited directly into an APcustody account, in a step S110 the trustee may move the assets into anAP custody account. In a step S112, the trustee may transfer assets toone or more trust digital wallets. In embodiments, these digital walletsmay be vault digital wallets which may be intended to hold assets forlong term storage. In a step S114, the trustee may send an assetnotification to provide for the asset transfer recorded on a network'stransaction ledger or may otherwise update or cause to be updated thenetwork's transaction ledger to reflect the transfer. In step S116, thetrustee may transfer or direct the transfer, e.g., by a third-partyclearing agency 250 (e.g., the DTC), of shares in the trust to the AP.In step S118, the trustee may delete the wallet or wallets into whichthe AP initially transferred the assets.

In an exemplary embodiment, the fund asset can be a digital asset. Inexemplary embodiments, the digital asset can be a bitcoin. To obtainshares in the trust, an AP may convert cash or anything of value to oneor more digital assets. This conversion may be performed independentlyof the ETP or may be performed through an entity or system related tothe ETP or may be performed through the ETP. In an exemplary embodiment,the AP obtains digital assets through an exchange. The AP may also havestored digital assets, e.g., an inventory of assets, which it may chooseto deposit with the ETP. The AP may then deposit the digital assets withthe ETP in exchange for one or more creation units of shares. Deposit ofdigital assets may occur via a public registry. The transfer of digitalassets may occur as a peer-to-peer (“P2P”) transaction, also known inthe art as an end-user to end user transaction.

In embodiments, the AP may first place a creation order with thetrustee, e.g., by transmitting the creation order to an administrativeoperations division of the trustee. In embodiments, as described above,shares may only be issued in creation units and/or in exchange fordigital assets of pre-defined amounts. For example, one creation unitmay consist of 50,000 shares and may be issued by the trustee incorrelation with a deposit of the requisite amount of digital assetsinto the trust's account.

The trustee may accept the AP's creation order, which may begin asettlement period, e.g., a 3-day settlement period, during which the APmay engage in a settlement process. The settlement process may allow anAP time to hedge, with one possible goal being to avoid or limit risk.In embodiments, no-limit risk may be applicable. In embodiments, a goalof the hedging process may be to protect, e.g., from price movements,the AP's position in the digital assets being delivered to the trust.

In embodiments, the trustee, using one or more computers, may establishone or more digital wallets for each creation. In embodiments, the oneor more digital wallets may comprise an AP custody account, which mayreceive assets deposited by an AP. In embodiments, an AP custody accountmay remain open throughout the process, and new digital wallets withinthe account may be created as needed and/or desired to fulfill ordersand allow transfers. In embodiments, the trust may provide its owndigital wallet system, which may include an interface and a programmedback end, or the trust may use an existing system. In embodiments, an APmay identify the public address of the digital wallet from which it willtransfer assets to the trust.

At or before the close of the settlement window, the AP may instruct thetrustee to transfer the required digital assets from the AP custodyaccount for deposit into the trust. Upon such transfer from the AP tothe trust, the AP may have satisfied its obligation. The trust, througha third-party clearing agency 250 (e.g., the DTC), may then issue sharesin the required number of creation units to the AP.

In an exemplary embodiment, digital assets may be transferred from theAP to the trust by transferring the assets first from the AP's one ormore outside digital wallets to the AP custody account's one or moredigital wallets and, second, from the AP custody account's one or moredigital wallets to the trust custody account's one or more digitalwallets. In embodiments, both the transferor and the transferee'sdigital wallets may be required to report the transaction(s) to aregistry or other system or entity in order for the transaction(s) tocomplete. In embodiments, there may be a time window within which bothwallets must report the transaction(s). In embodiments, a transactionledger will be updated to reflect the transfer(s).

FIG. 17B is a flow chart of a process for investing in the trust inaccordance with exemplary embodiments of the present invention. Inembodiments, the process depicted in FIG. 17B may be performed by thetrustee of the trust, the administrator of the trust on behalf of thetrust, the custodian, and/or one or more computers operated by one ormore of those entities or another entity. In exemplary embodiments, instep S122, a trust computer system including one or more computers maydetermine share price information based at least in part upon a firstquantity of digital math-based assets held by a trust at a first pointin time and a second quantity of shares in the trust at the first pointin time. In embodiments, the share price information may then betransmitted from the trust computer system to the one or more authorizedparticipant user devices. In embodiments, the step S122 may furthercomprise the steps of determining, by the trust computer system, a fifthquantity of digital math-based assets held by the trust that areattributable to shareholders; determining, by the trust computer system,a sixth quantity of digital math-based assets by subtracting from thefifth quantity a seventh quantity of digital math-based assetsassociated with trust expenses; and dividing the sixth quantity by aneighth quantity of outstanding shares. In embodiments, the share priceinformation, may be a quantity of digital math-based assets per shareand/or per a basket of shares corresponding to a number of sharesassociated with one creation unit of shares. In embodiments, the basketof shares may comprise one or more quantities of shares selected fromthe group consisting of: 5,000 shares, 10,000 shares, 15,000 shares,25,000 shares, 50,000 shares, and 100,000 shares.

In a step S124, the trust computer system may receive, from one or moreauthorized participant user devices of an authorized participant, anelectronic request to purchase a third quantity of shares.

In a step S126, the trust computer system may determine a fourthquantity of digital math-based assets based at least in part upon theshare price information and the third quantity of shares.

In a step S128, the trust computer system may be used to obtain one ormore destination digital asset account identifiers corresponding to oneor more destination digital asset accounts for receipt of digitalmath-based assets from the authorized participant. In embodiments, theone or more destination digital asset account identifiers may compriseone or more digital asset account addresses and/or public keys.

In a step S130, the one or more destination digital asset accountidentifiers and an electronic amount indication of the fourth quantityof digital math-based assets may be transmitted from the trust computersystem to the one or more authorized participant user devices.

In a step S132, an electronic transfer indication of a transfer ofdigital math-based assets to the destination digital asset account maybe received at the trust computer system. In embodiments, the electronictransfer indication may further comprise an identification of one ormore origin digital asset accounts.

In a step S134, the trust computer system may verify, using adecentralized electronic ledger maintained by a plurality of physicallyremote computer systems, a receipt of the fourth quantity of digitalmath-based assets in the one or more destination digital asset accounts.In embodiments, step S134 may further comprise the steps of accessing,using the trust computer system, a plurality of updates to thedecentralized electronic ledger; analyzing, using the trust computersystem, each of the plurality of updates for a first confirmation of thereceipt by a node in a network associated with the digital math-basedasset; and determining, using the trust computer system, a finalconfirmation of the receipt after detecting first confirmations of thereceipt in a predetermined number of the plurality of updates to thedecentralized electronic ledger. In embodiments, the plurality ofupdates to the decentralized electronic ledger may comprise new blocksadded to a bitcoin blockchain.

In a step S136, the trust computer system may be used to issue or causeto be issued the third quantity of shares to the authorized participant.

In embodiments, the process depicted in FIG. 17B may further comprisethe step of transferring, using the trust computer system, the fourthquantity of digital math-based assets into one or more digital assetaccounts associated with a trust custody account. In furtherembodiments, the process depicted in FIG. 17B may further comprise thestep of transmitting, from the trust computer system to the one or moreauthorized participant user devices, an electronic receiptacknowledgement indicating the receipt of the fourth quantity of digitalmath-based assets. In still further embodiments, the process depicted inFIG. 17B may further comprise the step of transmitting or causing to betransmitted, to the one or more authorized participant user devices, anelectronic share issuance indication of the issuing of the thirdquantity of shares.

In embodiments a system for determining and/or providing a blendeddigital math-based asset price can comprise one or more processors andone or more computer-readable media operatively connected to the one ormore processors and having stored thereon instructions for carrying outthe steps of: (i) determining, by a trust computer system including oneor more computers, share price information based at least in part upon afirst quantity of digital math-based assets held by a trust at a firstpoint in time and a second quantity of shares in the trust at the firstpoint in time; (ii) receiving, at the trust computer system from one ormore authorized participant user devices of an authorized participant,an electronic request to purchase a third quantity of shares; (iii)determining, by the trust computer system, a fourth quantity of digitalmath-based assets based at least in part upon the share priceinformation and the third quantity of shares; (iv) obtaining, using thetrust computer system, one or more destination digital asset accountidentifiers (e.g., one or more digital asset account addresses, and/orone or more digital asset account public keys, to name a few)corresponding to one or more destination digital asset accounts forreceipt of digital math-based assets from the authorized participant;(v) transmitting, from the trust computer system to the one or moreauthorized participant user devices, the one or more destination digitalasset account identifiers and an electronic amount indication of thefourth quantity of digital math-based assets; (vi) receiving, at thetrust computer system, an electronic transfer indication of a transferof digital math-based assets to the destination asset account; (vii)verifying, by the trust computer system using a decentralized electronicledger maintained by a plurality of physically remote computer systems,a receipt of the fourth quantity of digital math-based assets in the oneor more destination digital asset accounts; and (viii) issuing orcausing to be issued, using the trust computer system, the thirdquantity of shares to the authorized participant.

Deposit Distribution Waterfalls Among Wallets

The creation process involves the deposit of digital assets into thetrust's accounts. During a creation, assets or other funds may bedeposited into one or more trust accounts. In embodiments, a trust maylimit the number of assets or amount of funds stored in each of itswallets, e.g., for security reasons to reduce exposure if any one walletis compromised. In multi-wallet structures, various asset distributionsamong the wallets are possible, and various distribution methods orwaterfalls may be employed.

In embodiments, wallets may be filled in a pre-determined order. Inembodiments, wallets may be filled according to one or more desiredcapacities or account balances, e.g., deposit 10,000 bitcoins in eachwallet before proceeding to deposit in the next wallet.

FIGS. 18A and 18B are flow charts of various exemplary processes forassigning digital assets (e.g., bitcoins) obtained at creation anddistributing them among digital wallets in accordance with embodimentsof the present invention.

For example, with reference to FIG. 18A, an exemplary creationdistribution waterfall is illustrated. In embodiments, these steps maybe performed using AP computer systems, operated by one or more APsrequesting creation units, and trust computer systems, operated by thetrustee, custodian and/or administrator on behalf of the trust.

In step S220, a fixed number of digital wallets to be stored in one ormore vaults can be created in advance of anticipated use. In creatingthe digital wallets, as described herein e.g., in relation to FIG. 5A,the private key for each wallet may be parsed into two or more segmentsand/or encoded and stored in paper form. In embodiments, the keysegments may be further encrypted before storing in paper form. Thecorresponding public key may be kept readily available for theadministrator and/or custodian to access.

In step S222, an AP using an AP computer system can send to the trustee,custodian and/or administrator using a trust computer system, which inturn receives, assets (e.g., digital math assets such as bitcoins) to bedeposited into the trust. For example, the trust computer system cansend electronically to the AP computer system a public key associatedwith a trust custody account to receive the digital assets. The AP canthen enter the public key into an AP digital wallet on the AP computersystem to send the required digital assets (e.g., bitcoins) from the APaccount to the trust custody account using the AP's private key and thepublic key associated with the trust custody account. The trust computersystem can then acknowledge (e.g., electronically) receipt of thetransferred digital assets in the trust custody account. In embodiments,one or more AP accounts and/or one or more trust custody accounts can beused. The trust custody account can be an AP custody account and/or avault account, as appropriate, to name a few.

In embodiments, in step S224, after receipt of digital assets depositedinto the trust, digital assets deposited by an AP into the trust, can betransferred using the trust computer system to one or more digitalwallets associated with an AP trust custody account. In embodiments, theinitial transfer of assets may be made directly one or more AP accountsinto one or more AP custody accounts.

In step S226, the digital assets in the digital wallets associated withthe AP trust custody account may be transferred using the trust computersystem in whole or part into one or more of the previously createddigital wallets whose private key segments are stored in vaults. Inembodiments, the digital assets may be distributed by the trust computersystem to trust wallets, such as discussed in the context of FIG. 18Bherein, or according to another distribution algorithm.

With reference to FIG. 18B, an exemplary creation distribution waterfallis illustrated. In embodiments, these steps may be performed using APcomputer systems, operated by one or more APs requesting creation units,and trust computer systems, operated by the trustee, custodian and/oradministrator on behalf of the trust.

In step S240, an AP custodial digital wallet can be created using thetrust computer system to receive assets from an AP digital wallet on anAP computer system.

In step S242, an AP using an AP computer system can send to the trustee,custodian and/or administrator using a trust computer system (which inturn receives) assets (e.g., digital math assets such as bitcoins) to bedeposited into the trust. For example, the trust computer system cansend electronically to the AP computer system a public key associatedwith a trust custody account to receive the digital assets. The AP canthen enter the public key into an AP digital wallet on the AP computersystem to send the required digital assets (e.g., bitcoins) from the APaccount to the trust custody account using the AP's private key and thepublic key associated with the trust custody account. The trust computersystem can then acknowledge (e.g., electronically) receipt of thetransferred digital assets in the trust custody account. In embodiments,one or more AP accounts and/or one or more trust custody accounts can beused. The trust custody account can be an AP custody account and/or avault account, as appropriate, to name a few.

In step S244, after receipt of digital assets deposited into the trust,digital assets deposited by an AP into the trust, can be transferredusing the trust computer system to one or more digital walletsassociated with an AP trust custody account. In embodiments, the initialtransfer of assets may be made directly one or more AP accounts into oneor more AP custody accounts.

In embodiments, the creation distribution methodology/algorithm candepend at least in part upon one or more of the following criteria orparameters:

-   -   setting a maximum amount of digital assets stored in each wallet        (e.g., limiting to 10,000 bitcoins in each wallet);    -   setting a minimum amount of digital assets stored in each wallet        (e.g., at least 100 bitcoins in each wallet);    -   setting a maximum ratio of maximum amount to minimum amount of        digital assets stored in each wallet (e.g., a 10-to-1 ratio);    -   setting a random amount of digital assets to be stored in each        wallet, wherein the random amount is greater than a minimum        amount and less than a maximum amount;    -   limiting the number of uses of each wallet (e.g., never using        the same wallet more than once);    -   resetting the maximum amount and the minimum amount of digital        assets stored in each wallet based at least in part on increased        or decreased volume of digital assets held by the trust;    -   setting a maximum amount of digital assets transferred to each        wallet in any given transaction (e.g., limiting to 10,000        bitcoins in each wallet);    -   setting a minimum amount of digital assets transferred to each        wallet in any given transaction (e.g., at least 100 bitcoins in        each wallet);    -   setting a maximum ratio of maximum amount to minimum amount of        digital assets transferred to each wallet in any given        transaction (e.g., a 10-to-1 ratio);    -   setting a random amount of digital assets to be transferred to        each wallet in any given transaction, wherein the random amount        is greater than a minimum amount and less than a maximum amount;    -   limiting the number of transfers to a given wallet (e.g., never        using the same wallet more than once, never make more than two        transfers to the same wallet during a year period, to name a        few);    -   resetting the maximum amount and the minimum amount of digital        assets transferred to and/or from each wallet based at least in        part on increased or decreased volumes of digital assets held by        the trust; and/or    -   performing transfers to one or more wallets, e.g., vault        wallets, at random and/or varied times of day (e.g., make a        transfer at 4:00 PM ET on one day and make a transfer at 4:18 PM        ET the following day; make a transfer to one wallet at 4:00 PM        ET and another wallet at 5:13 PM ET the same day).

Redemptions from ETP

In embodiments a method for redeeming shares in a trust associated withan exchange traded product holding digital math-based assets maycomprise receiving, at a trust computer system from an AP computersystem, a redemption order from an AP to redeem a first number of sharesin the trust; determining, using the trust computer system, one or moretrust wallets to access to satisfy the redemption order; generating,using the trust computer system, instructions to a custodian to retrieveat least one copy of each private key segment corresponding to the oneor more trust wallets; sending the instructions to the custodian;reassembling, using the trust computer system, the one or more trustwallets using the at least one copy of each private key segment;transferring, using the trust computer system, from the one or moretrust wallets a first number of digital math-based assets to an APwallet associated with the AP; generating, using the trust computersystem, instructions to the third-party clearing agency to cancel thefirst number of shares in the trust of the AP; and sending theinstructions to the third-party clearing agency. In embodiments, thetrustee using the trust computer system may approve the redemption orderand/or send confirmation (e.g., electronically) of the order.

In embodiments, the redemption distribution from the trust may consistof a transfer to the redeeming AP's Authorized Participant CustodyAccount of the number of the bitcoins held by the trust in the TrustCustody Account evidenced by the shares being redeemed. In embodiments,fractions of a bitcoin included in the redemption distribution smallerthan a Satoshi (i.e., 0.00000001 of a bitcoin) may be disregarded. Inembodiments, redemption distributions may be subject to the deduction ofany applicable tax or other governmental charges that may be due.

FIG. 19A is a flow chart of a process for redeeming shares in the trustin accordance with exemplary embodiments of the present invention. Inembodiments, the processes depicted in FIG. 19A may be performed by thetrustee, the administrator, the custodian, and/or a trust computersystem comprising one or more computers operated by one or more of thoseentities or another entity.

In step S202, the trust computer system may receive a request, e.g., aredemption order, from an AP computer system for an AP to redeem sharesin the trust. In embodiments, the trustee using the trust computersystem may approve the redemption order and/or send confirmation (e.g.,electronically) of the order. In embodiments, a settlement processentailing, for example, a 3-day settlement window, may be triggered.Other durations of settlement periods may be used as convenient. Inembodiments, the trust computer system may receive from the AP computersystem one or more public keys associated with AP wallets and/or APaccounts to which redemption proceeds are designated by the AP to bedistributed. For example, public key information may be sentelectronically from the AP computer system to the trust computer systemusing, e.g., a digital wallet, e-mail, text message, a digital assetexchange, electronic communications, to name a few. In embodiments, thetrustee may designate one or more existing trust custody wallets and/orcreate one or more new wallets using the trust computer system to beused as AP custody accounts. In embodiments, the trustee may determinethe number of digital assets (e.g., bitcoins) required for theredemption, e.g., by using the trust computer system to multiply thenumber of shares to be redeemed by the NAV value per share less anytransaction fees associated with the redemption. In embodiments,depending upon the timing of the redemption, an ANAV value per share maybe used in lieu of the NAV value per share. The trust may request and/orreceive, e.g., through the third-party clearing agency 250 (e.g., theDTC), shares to be redeemed.

In step S204, the trust computer system may determine one or morewallets to access to satisfy the redemption. The determination as to howmany and which wallets should be used to redeem assets may be based atleast in part on one or more of the parameters discussed herein (see,e.g., Redemption Distribution Waterfalls Among Wallets).

In step S206, the trustee may instruct the custodian to retrieve fromone or more vaults a copy of each private key segment comprising one ormore private keys corresponding to the digital wallets that will beaccessed to satisfy the redemption. In embodiments, special securitymeasures may be implemented to limit the risk of one or more keysegments being lost, damaged and/or stolen in transport. For example,bonded armored cars can be used to transport key segments. The timing ofkey segment retrieval and transport may be spaced so that only onesegment is transported at a time. The timing and/or route of retrievalmay also be randomized and/or varied to avoid predictability oftransport of key segments from the vault to the administrative portal.

In step S208, the trustee, administrator and/or custodian using thetrust computer system may use the retrieved private key segments toreassemble the private keys. In embodiments, this may be performed bydecrypting the private key segments and reassembling the segments into acomplete private key. In embodiments, the retrieved private key segmentsmay be scanned using key reader 40, and decrypted (as necessary) usingdecryption software on the isolated computer 30 as part of the trustcomputer system, and combined and associated with the correspondingpublic key to regenerate a trust wallet.

In embodiments, as described in a step S208′ in FIG. 19B, the trustee,administrator, and/or custodian using the trust computer system maydecrypt the private key segments, reassemble the key segments into fullkeys, and/or reverse any cipher that was previously applied. Inembodiments, these sub-steps of step S208′ may be performed in any orderwhich will result in a properly reassembled private key. In embodiments,they are performed in the reverse order of the steps used to secure andstore the keys. In embodiments, the key segments are decrypted first,then reassembled into a complete key, then deciphered. The completedeciphered key may then be used to access and/or transact using adigital wallet.

In step S210, the trust computer system may identify and/or correlatethe one or more private keys with the associated public keys to createone or more digital wallets to access the digital assets. Inembodiments, preassembled wallets may be generated on one or moreisolated transaction computers 32 to hold public key and private keyinformation and transfer instructions awaiting closing. In embodiments,the use of preassembled wallets may expedite the wallet generationprocess associated with digital math based assets. In embodiments, thetrust computer system may include one or more digital asset miners(e.g., bitcoin miners) to allow for prompt transfer of ledgerinformation to reassembled digital wallets. In embodiments, digitalmath-based assets earned by the digital asset miners may be added to thetrust and/or paid to the administrator and/or sponsor as a fee.

In step S212, the trust computer system may reassemble, regenerate, orotherwise access the one or more trust custody account digital wallets(which may, in embodiments, be vault wallets) using the private and/orpublic keys. The trust computer system may transfer, from the one ormore vault wallets to one or more digital wallets in the AP custodyaccount, the assets being redeemed, and then transfer such assets beingredeemed to the AP's one or more outside digital wallets. Inembodiments, the AP wallet may be an AP custodial wallet. Inembodiments, the trust computer system may delete or destroy one or morewallets involved in the transaction, e.g., the AP custody wallet and/orany vault wallets that were emptied, to name a few.

In step S214, the trustee may cancel and/or instruct to cancel, e.g.,using the third-party clearing agency 250 (e.g., DTC), the AP's sharescorresponding to the number of assets withdrawn and delivered to the AP.

In embodiments, in step S216, the AP may convert the assets to someother asset or currency or use them to conduct one or more transactions.

In embodiments, security measures, such as described with respect toFIG. 8, may be implemented. In embodiments, a wallet created on theisolated computer 30 may be copied in part to create a watching walletthat may create unsigned transactions and/or broadcast already signedtransactions. In embodiments, the watching wallet may not containprivate key data. The watching wallet may be loaded onto the networkedcomputer 20. The networked computer 20 may then be used to create one ormore unsigned transactions. The unsigned transaction data may betransferred from the networked computer 20 to the isolated computer 30.Such transfer may be manual, such as by downloading the unsignedtransaction data to a removable storage device comprising computerreadable medium (e.g., a USB flash drive, CD, CD-ROM, DVD, removablehard drive, disk, memory card, to name a few), physically disconnectingthe storage device from the networked computer 20, operativelyconnecting the storage device to the isolated computer 30, and uploadingthe unsigned transaction data to the isolated computer 30. Inembodiments, networked computer 20 may be connected, directly orindirectly, to isolated computer 30, which connection may comprisesecurity measures, such as a firewall, designed to prevent unauthorizedaccess of the isolated computer 30. After receiving the unsignedtransaction data, the digital wallet on the isolated computer 30 may beused to sign the transaction. The signed transaction data may then betransferred from the isolated computer 30 to the networked computer 20in any of the manners described herein. The networked computer 20 maythen broadcast the signed transaction data to the network, which maycomplete the transaction.

FIG. 19C is a flow chart of another exemplary process for redemption ofshares in an ETP.

In a step S2022, a trust computer system comprising one or morecomputers may determine share price information based at least in partupon a first quantity of digital math-based assets held by a trust at afirst point in time and a second quantity of shares in the trust at thefirst point in time. In embodiments, the share price information may betransmitted to one or more authorized participant user devices. Theshare price information can comprise a net asset value per share, anadjusted net asset value per share, and/or a net asset value per abasket of shares (e.g., where the number of shares comprising the basketof shares may be associated with one creation unit of shares), to name afew. In embodiments, the basket of shares can comprise any of 5,000shares, 10,000 shares, 15,000 shares, 25,000 shares, 50,000 shares, or100,000 shares, to name a few.

In a step S2024, the trust computer system may receive from one or moreauthorized participant user devices of an authorized participant, anelectronic request (e.g., a redemption order) to redeem a third quantityof shares.

In a step S2026, the trust computer system may determine a fourthquantity of digital math-based assets based at least in part upon theshare price information and the third quantity of shares. Determiningthe fourth quantity of digital assets can comprise obtaining a net assetvalue per share; determining a digital math-based asset value of thethird quantity of shares based upon the net asset value per share;determining transaction fees (e.g., denominated in a unit of the digitalmath-based asset) and/or expenses associated with the electronic requestto redeem shares; and determining the fourth quantity of digitalmath-based assets by subtracting the transaction fees from the digitalmath-based asset value of the third quantity of shares.

In a step S2028, the trust computer system may obtain one or moredestination digital asset account identifiers corresponding to one ormore destination digital asset accounts for receipt by the authorizedparticipant of a transfer of the fourth quantity of digital math-basedassets from the trust. The destination digital asset accounts maycorrespond to an authorized participant custody account.

In a step S2030, the trust computer system may obtain one or more origindigital asset account identifiers corresponding to one or more origindigital asset accounts for the transfer. In embodiments, the origindigital asset accounts may be securely stored accounts, as describedherein. The origin digital asset accounts may correspond to a trustcustody account.

In a step S2032, the trust computer system may initiate the transfer ofthe fourth quantity of digital math-based assets from the one or moreorigin digital asset accounts to the one or more destination digitalasset accounts. Initiating a transfer of assets from the trust cancomprise retrieving or causing to be retrieved (e.g., issuing retrievalinstructions) one or more private keys associated with the one or moreorigin digital asset accounts, and accessing the one or more origindigital asset accounts using at least the one or more private keys.

Retrieving keys can comprise issuing retrieval instructions forretrieving a plurality of encrypted private keys corresponding to theone or more origin digital asset accounts; receiving, at the trustcomputer system, the plurality of encrypted private keys; and obtaining,using the trust computer system, one or more private keys by decryptingthe plurality of private keys.

In other embodiments, retrieving keys can comprise issuing, using thetrust computer system, retrieval instructions for retrieving a pluralityof private key segments corresponding to the one or more origin digitalasset accounts; receiving, at the trust computer system, the pluralityof private key segments; and obtaining, using the trust computer system,one or more private keys by assembling the plurality of private keys.

In still other embodiments, retrieving keys can comprise issuing, usingthe trust computer system, retrieval instructions for retrieving aplurality of encrypted private key segments corresponding to the one ormore origin digital asset accounts; receiving, at the trust computersystem, the plurality of encrypted private key segments; and obtaining,using the trust computer system, one or more private keys by decryptingthe plurality of private key segments and assembling the segments intoone or more private keys.

For a multi-signature digital asset account, retrieving keys cancomprise issuing, using the trust computer system, retrievalinstructions for retrieving a plurality of encrypted private keysegments corresponding to the one or more origin digital asset accounts;receiving, at the trust computer system, the plurality of encryptedprivate key segments; obtaining, using the trust computer system, one ormore first private keys by decrypting the plurality of private keysegments and assembling the segments into one or more first privatekeys; and obtaining, using the trust computer system, at least onesecond private key corresponding to the one or more origin digital assetaccounts.

In a step S2034, the trust computer system may broadcast the transfer toa decentralized electronic ledger maintained by a plurality ofphysically remote computer systems.

In a step S2036, the trust computer system may verify, using thedecentralized electronic ledger, a receipt of the fourth quantity ofdigital math-based assets at the one or more destination digital assetaccounts. Transaction verification can comprise accessing, using thetrust computer system, a plurality of updates to the decentralizedelectronic ledger (e.g., new blocks added to a bitcoin blockchain);analyzing, using the trust computer system, each of the plurality ofupdates for a first confirmation of the receipt by a node in a networkassociated with the digital math-based asset; and determining, using thetrust computer system, a final confirmation of the receipt afterdetecting first confirmations of the receipt in a predetermined numberof the plurality of updates to the decentralized electronic ledger.

In a step S2038, the trust computer system may cancel or cause to becanceled (e.g., by issuing instructions to a third-party clearingagency) the third quantity of shares from the authorized participant.

In embodiments, the process can include determination of and/orinstitution of a settlement period associated with the electronicrequest to redeem shares.

In embodiments, the trust computer system may be operated by a trusteeand/or an administrator of the trust.

In embodiments a system for determining and/or providing a blendeddigital math-based asset price can comprise one or more processors andone or more computer-readable media operatively connected to the one ormore processors and having stored thereon instructions for carrying outthe steps of (i) determining, by a trust computer system comprising oneor more computers, share price information based at least in part upon afirst quantity of digital math-based assets held by a trust at a firstpoint in time and a second quantity of shares in the trust at the firstpoint in time; (ii) receiving, at the trust computer system from the oneor more authorized participant user devices of the authorizedparticipant, an electronic request to redeem a third quantity of shares;(iii) determining, by the trust computer system, a fourth quantity ofdigital math-based assets based at least in part upon the share priceinformation and the third quantity of shares; (iv) obtaining, by thetrust computer system, one or more destination digital asset accountidentifiers corresponding to one or more destination digital assetaccounts for receipt by the authorized participant of a transfer of thefourth quantity of digital math-based assets from the trust; (v)obtaining, using the trust computer system, one or more origin digitalasset account identifiers corresponding to one or more origin digitalasset accounts for the transfer; (vi) initiating, using the trustcomputer system, the transfer of the fourth quantity of digitalmath-based assets from the one or more origin digital asset accounts tothe one or more destination digital asset accounts; (vii) broadcasting,using the trust computer system, the transfer to a decentralizedelectronic ledger maintained by a plurality of physically remotecomputer systems; (viii) verifying, by the trust computer system usingthe decentralized electronic ledger, a receipt of the fourth quantity ofdigital math-based assets at the one or more destination digital assetaccounts; and (ix) canceling or causing to be canceled, using the trustcomputer system, the third quantity of shares from the authorizedparticipant.

Redemption Distribution Waterfalls Among Wallets

In embodiments, a redemption distribution waterfall may be implementedusing one or more computers based at least in part on one or moreparameters. In embodiments, such parameters may include at least one ormore of the following:

-   -   the order in which the wallet was created (e.g., first wallet        created is first wallet used, last wallet created is last wallet        used, to name a few);    -   the order in which the wallet was filled (e.g., first wallet        filed is first wallet used, last wallet created is last walled        used, to name a few);    -   a random order in which the wallet was created;    -   a random order in which the wallet was filled;    -   a random selection of the wallet;    -   the vault in which the wallet is stored;    -   the custodian of a vault storing the pair segments associated        with a wallet;    -   the amount of digital assets needed for a redemption compared to        available in the wallet;    -   the relative amount of digital assets held in the wallet (e.g.,        use the largest wallets first, use the smallest wallets first,        to name a few); and/or    -   the risk that a wallet has been compromised, to name a few.

Examples of Financial Products Associated with ETPs Holding DigitalAssets

In embodiments, insurance may be provided for digital assets. Suchinsurance may be provided to individual users of digital assets(including vendors), groups of users, exchanges, exchange agents, trustsproviding exchange traded products associated with digital assets, toname a few. Insurance may be provided for a digital asset wallet and/orthe contents of a digital asset wallet (e.g., insurance for 100 Bitcoinsstored in a digital wallet). Such insurance may involve secure storageof the private key to a wallet and/or the public key. In embodiments,the blended digital math-based asset price as discussed herein may beused as a benchmark for such insurance.

In embodiments, a digital asset kiosk, such as a digital math-basedasset kiosk, may be used to perform one or more transactions associatedwith digital assets. The transactions may require an appropriate moneytransmit business in order to meet regulatory requirements. Inembodiments, a person or entity must use a money transmit businessregistered in the person or entity's domicile.

NAV Calculation

In embodiments, an ETP may use a blended digital math-based asset priceas a benchmark. Accordingly, a net asset value (“NAV”) of shares in atrust for an exchange traded product holding digital math-based assetsmay be calculated based in part upon a blended digital math-based assetprice or a digital asset index, which may in turn comprise a pluralityof blended digital math-based asset prices. A NAV may be determined byobtaining, using one or more computers from one or more exchangecomputers, a value of digital math-based assets held by the trust at adefined time; calculating or obtaining, using the one or more computers,a blended digital asset value of the digital math-based assets duringthe predefined period of time; calculating, using the one or morecomputers, the value of the digital math-based assets held by the trustat a defined time by multiplying the units of each digital math-basedasset held by the trust by the price per unit of each such digitalmath-based asset; determining or obtaining, using the one or morecomputers, estimated accrued but unpaid expenses, including sponsorfees, incurred by the trust since the last payment of a sponsor fee upto, but not included, the date on which the valuation is made;calculating, using the one or more computers, the adjusted net assetvalue of the trust by subtracting the estimated accrued but unpaid feesand expenses since the last payment of a sponsor fee up to, andincluded, the last valuation date of the digital math-based assets heldby the trust on such date; determining or obtaining, using the one ormore computers, estimated unpaid fees and expenses incurred by the trustsince the last valuation date; calculating, using the one or morecomputers, net asset value of the trust by subtracting estimated accruedbut unpaid fees and expenses incurred since the last valuation date formthe adjusted net asset value of the trust; calculating, using the one ormore computers, net asset value per share of the trust by dividing thenet asset value of the trust by a number of outstanding shares of thetrust; storing in one or more databases on computer readable mediaoperatively connected to the one or more computers the accrued butunpaid fees and expenses, adjusted net asset value, net asset value andthe net asset value per share of the trust; and publishing, from the oneor more computers to one or more publication systems, the net assetvalue and the net asset value per share of the trust. In embodiments atime period of 12 hours, 24 hours, or 36 hours may be used.

In embodiments, NAV of a trust or its equivalent can be calculated by acomputer system comprising one or more computer. For example, inembodiments, a NAV can be calculated using one or more computers on adaily basis (for each evaluation day, e.g., a day on which the trustshares are available to be created, redeemed and/or exchanged). Inembodiments, a NAV can use one or more formulas to estimate a fairmarket value of a unit of a digital asset and/or a share in a trust at agiven point in time. In embodiments, an industry standard formula can beused to calculate a NAV. In embodiments, a proprietary formula can beused to calculate a NAV. For example, one or more computers maycalculate a digital asset price using data from the largest exchanges inthe digital asset exchange market. In embodiments, a blended digitalasset price can be calculated by one or more computers using an averagedprice.

In embodiments, a blended digital asset price can be the price fordigital assets determined each valuation day at a set time, such as,e.g., 3:00 p.m. Eastern Time. In embodiments, a blended digitalmath-based asset price may be obtained from a blended digital math-basedasset index, which may be accessed via an API. In embodiments, thesystem may calculate a blended digital asset price, by obtainingtransaction data from one or more exchanges selected from a list ofexchanges approved by, e.g., the sponsor, to determine either theaverage of the high and low prices on each exchange or the weighted(based on volume of shares traded) average of the transaction prices forthe prior fixed time period (e.g., 12 or 24 hours) of trading activityon such one or more exchanges. In embodiments, the system may thenaverage the price for each exchange, using weighting based on eachexchange's volume during the period. Other methodologies can be used bythe system to calculated the blended digital asset prices. For example,three exchanges, four exchanges, five exchanges, ten exchanges, or anynumber of exchanges as may be appropriate in view of the market for themath-based assets may be selected to determine the blended digital assetprice. In embodiments, a time period of other than 12 or 24 hours mayalso be used depending upon the volume and volatility of the math-basedasset price. For example, in a low volume period the time period may beincreased to, e.g., 36 hours, while in a high volatility period the timeperiod may be decreased to, e.g., 4 hours. In embodiments, a blendeddigital math-based asset price may be calculated by computing a volumeweighted exponential moving average of actual transactions (e.g.,considering price and volume of each executed transaction) from one ormore digital asset exchange. In embodiments, the moving average may betaken over a period such as 2 hours. In embodiments, other periods maybe used, such as 24 hours, 1 hour, 30 minutes, and/or 15 minutes, toname a few.

FIG. 20A is a flow chart of processes for calculating the NAV value ofshares in a trust holding digital assets in accordance with embodimentsof the present invention. In embodiments, these processes may beperformed by a calculation agent 240, by one or more computers, and/orby some other entity using one or more computers. In a step S402, theone or more computers may obtain from one or more exchanges the value ofdigital assets during a predefined period of time. In a step S404 ablended digital asset value may be calculated for the predefined periodof time. In embodiments, the blended digital asset value may also beobtained from an external computer system, such as an electronicpublished index system. In a step S406, the value of digital assets heldby the trust may be calculated. In a step S408, the ANAV may becalculated. In embodiments, the ANAV may be calculated by subtractingestimated accrued but unpaid fees and expenses from the calculated valueof digital assets held by the trust. In a step S410, the accrued dailyexpense may be calculated. In a step S412, the NAV may be calculated. Ina step S414, the NAV per share (NAV/share) may be calculated.

FIG. 20B is a flow chart of processes for calculating the NAV value ofshares in a trust holding bitcoins in accordance with embodiments of thepresent invention. In embodiments, these processes may be performed by acalculation agent 240, by one or more computers, and/or by some otherentity using one or more computers. In a step S402′, the one or morecomputers may obtain from one or more exchanges the value of bitcoinsduring a predefined period of time. In a step S404′ a blended bitcoinvalue may be calculated for the predefined period of time. In a stepS406′, the value of bitcoins held by the trust may be calculated. In astep S408′, the ANAV may be calculated. In embodiments, the ANAV may becalculated by subtracting estimated accrued but unpaid fees and expensesfrom the calculated value of bitcoins held by the trust. In a stepS410′, the accrued daily expense may be calculated. In a step S412′, theNAV may be calculated. In a step S414′, the NAV per share (NAV/share)may be calculated.

FIG. 21A is a flow chart of additional processes associated with theevaluation day for calculating NAV value of shares in a trust holdingdigital assets in accordance with embodiments of the present invention.The processes described by FIG. 21A may be performed by one or morecomputers operated by one or more entities, such as a calculation agent240. In a step S502, the unpaid and accrued unpaid fees and expensessince the last evaluation day, which may include each category of feesand/or expenses, may be calculated. In a step S504, the number ofdigital assets to redeem for expenses may be calculated from the blendeddigital asset value and the unpaid and accrued unpaid fees and expensessince the last evaluation day. In a step S506, the calculated number ofdigital assets may be transferred from the trust to correspondingaccounts, e.g., a sponsor account for the sponsor fee. In a step S508,the remaining number of digital assets held by the trust may becalculated. In a step S510, the NAV may be calculated. In a step S512,the value of the NAV per share may be calculated.

FIG. 21B is a flow chart of additional processes associated with theevaluation day for calculating NAV value of shares in a trust holdingbitcoins in accordance with embodiments of the present invention. Theprocesses described by FIG. 21B may be performed by one or morecomputers operated by one or more entities, such as a calculation agent240. In a step S502′, the unpaid and accrued unpaid fees and expensessince the last evaluation day, which may include each category of feesand/or expenses, may be calculated. In a step S504′, the number ofbitcoins to redeem for expenses may be calculated from the blendedbitcoin value and the unpaid and accrued unpaid fees and expenses sincethe last evaluation day. In a step S506′, the calculated number ofbitcoins may be transferred from the trust to corresponding accounts,e.g., a sponsor account for the sponsor fee. In a step S508′, theremaining number of bitcoins held by the trust may be calculated. In astep S510′, the NAV may be calculated. In a step S512′, the value of theNAV per share may be calculated.

The NAV and NAV per Share can be published daily after its calculationusing one or more computers. A third party agent can be employed toperform the calculation and to electronically publish it. Inembodiments, the following process can be used:

Step 1: Valuation of Digital Assets

In embodiments, a NAV and NAV per Share, can be struck using one or morecomputers each evaluation day (e.g., each day other than a Saturday orSunday or any day on which the listing exchange 235 is not open forregular trading).

The NAV and NAV per Share striking can occur at or as soon as reasonablypracticable after a predetermined time of day (e.g., 4:00 p.m. Easterntime) each evaluation day and can be conducted by the trustee.

The first step for striking the NAV may be the valuation of the digitalassets held by the Trust. In embodiments, the calculation methodologyfor valuing the Trust's digital assets can be as follows:Value of digital assets=(# of digital assets held by trust)×(blendeddigital asset price)

If the blended digital asset price is unavailable on any given day, thesponsor can instruct the use of the prior day's blended digital assetprice or, if the prior day's blended digital asset Price is deemedunfair/unsuitable, such other price as it deems fair.

Step 2: Calculation of ANAV

Once the value of the digital assets in the trust has been determined onan evaluation day, the trustee, using one or more computers, cansubtract all estimated accrued but unpaid fees (other than the feesaccruing for such day on which the valuation takes place computed byreference to the value of the Trust or its assets), expenses and otherliabilities of the trust from such NAV of the trust. The resultingfigure is the adjusted net asset value (“ANAV”) of the trust. The ANAVcan be used to calculate fees of trustee and/or sponsor.

In embodiments, the ANAV can calculated using the following methodology:ANAV=(value of digital assets)−(estimated accrued but unpaidfees/expenses/liabilities)Step 3: Calculation of Daily Expense

Once the NAV has been determined, any fees or expenses that accruedsince the last striking of the NAV can be calculated using one or morecomputers based on the evaluation day ANAV.

All fees accruing for the day (and each day since the last evaluationday) on which the valuation takes place computed by reference to thevalue of the trust or its assets can be calculated by one or morecomputers using the ANAV calculated for such evaluation day.

In embodiments, in arrears using the average of the daily ANAV for theprior month, the daily expense fee (for each day since prior evaluationday) can be estimated on a daily basis using the following methodology:Daily Expense*=(Sponsor's Fee)+(other fees)+(other expenses orliabilities accruing since the prior Evaluation Day)Step 4: Calculation of NAV and NAV Per Share

In embodiments, the trustee can calculate using one or more computersthe NAV, by subtracting from the ANAV the Daily Expense.

In embodiments, the trustee can also calculate using one or morecomputers the NAV per share by dividing the NAV of the trust by thenumber of the shares outstanding as of the close of trading. Inembodiments, the number of shares outstanding as of the close of tradingmay be obtained from the NYSE Arca (which includes the net number of anyShares created or redeemed on such evaluation day).

Calculation Methodology:NAV=ANAV−(Daily Expense)NAV per Share=NAV÷(# of Shares outstanding)The Blended Digital Asset Price

A blended digital asset price, such as a blended digital math-basedasset price, can be calculated, using one or more computers, eachevaluation day. Systems and methods for calculating a blended digitalasset price are described in U.S. application Ser. No. 14/313,873, filedJun. 24, 2014, the contents of which are incorporated herein byreference.

The calculation can occur as of and at or as soon as reasonablypracticable after 3:00 p.m. Eastern time each evaluation day (time couldalso be noon, 1 p.m., 2 p.m.—simply needs to be sufficient time beforeNAV striking to complete the calculations).

The blended digital asset price can be the functional equivalent of arules-based index and therefore has rules to populate the universe ofdata inputs and rules on calculation using such inputs. As discussedherein, the blended digital asset price can be used to create an index,to be electronically published. The index can, in turn, also serve as aprice benchmark or can be used to create derivative products.Accordingly, in embodiments, a blended digital math-based asset indexmay be a benchmark for a derivative product, an exchange tradedderivative product, a fund, a company, an exchange traded fund, a note,an exchange traded note, a security, a debt instrument, a convertiblesecurity, an instrument comprising a basket of assets including one ormore digital math-based assets, and/or an over-the-counter product, toname a few.

In embodiments, a blended digital asset price may be obtained from adigital asset index. For example, one or more computers may access(e.g., via an API) one or more blended digital math-based asset valuesfrom a computer or database of underlying digital asset index values. Inembodiments, digital asset index values may be interpolated to determinea value at a requested point in time, e.g., 4 p.m. E.T.

Eligible Data Inputs for a Blended Digital Asset Price

In embodiments, data for the blended digital asset price can be drawnfrom the largest exchanges that publicly publish transaction data andprincipally utilize acceptable currencies, e.g., currencies other thanthe Chinese Yuan. In this example, the Yuan denominated exchanges maynot be included because of manipulation of that currency andunreliability thereof. In embodiments, additional currency denominationsmay be added or excluded at one or more future dates, which may be datesfollowing the initial formation of the trust.

The sponsor can approve each eligible exchange (which, in embodiments,can be no fewer than three to five exchanges at any given time).

Selection of Data Inputs for a Blended Digital Asset Price

The rules for the blended digital asset price can provide for the use incalculation of the data from the three largest exchanges (by volume) onthe sponsor approved list.

In embodiments, this determination of the three exchanges for use can bedone on a weekly basis, (e.g., on each Monday) based at least in part onthe volume on each such exchange during the prior week. In embodiments,this determination could be done on a different periodic basis (e.g., ona daily basis or a monthly basis) or on a when needed basis (e.g.,whenever some circumstances occurs requiring a change of determination).

In embodiments, so long as exchange selection is not on a daily basis,to the extent an exchange that has been selected for inclusionexperiences a halt in trading for more than 24 consecutive hours (e.g.,a lack of any recorded transactions during the prior 24 hours,regardless of the reason), that exchange can be replaced by the nextlargest exchange (by volume) on the sponsor approved list. Inembodiments, this determination can be made automatically by one or morecomputers as part of an algorithm.

In embodiments, in the instance of a replacement, the restoration ofdaily volume on the halted exchange to a level more than the dailyvolume on the exchange that substituted for it could trigger a reversalof the substitution, if such restoration occurred prior to the nextscheduled reconstitution of the included exchanges.

In embodiments, an exchange may be removed where there is a significantdrop in trading on that exchange (e.g., 90% drop in trading volume)during a relevant time period (e.g., prior 24 hours, prior week, priormonth, to name a few).

FIG. 22 illustrates an exemplary process for determining qualified orapproved exchanges in accordance with the present invention. Inembodiments, this process may be used to determine qualified moneytransmit businesses instead of exchanges and/or a combination thereof.The process may be programmed with computer code, which may be run onone or more processors. The process can utilize pre-defined criteria,rules, parameters, and/or thresholds to determine qualified exchanges.Such criteria can include transaction volume criteria, denominationtypes, geographic location, exchange data availability, exchangeaccessibility information (e.g., considerations of political orregulatory restrictions), regulatory compliance data, exchange customerdata, and/or exchange owner data, to name a few. Thresholds can beexpressed as absolute values and/or percentages.

In a step S2402, one or more computers may obtain exchange transactiondata for an exchange, where the data covers at least one trackingperiod. The exchange data may be received via electronic transmission(e.g., over the Internet) and/or electronically accessed (e.g., usingone or more APIs). The tracking period may be any period of time overwhich the exchange will be assessed for approval for use in thecalculation of a blended digital asset price, such as 15 minutes, 1hour, 12 hours, 24 hours, and/or 1 week, to name a few.

In a step S2404, the one or more computers may determine whether avolume traded on the exchange during the tracking period satisfies athreshold volume. In embodiments, a threshold volume may be 500 units ofdigital assets. In embodiments, a threshold volume may be expressed as apercent (e.g., a percent of the digital assets in circulation). Thethreshold may be modified periodically to help increase or decrease thenumber of qualified exchanges.

In a step S2406, the one or more computers may determine whether theexchange transacts in an approved currency. The computers may eithertest for an approved currency (e.g., by comparing to a database ofapproved currencies) or for an unapproved currency (e.g., by comparingto a database of unapproved currencies). In embodiments, only onecurrency may be approved, and the test for that currency may behard-coded in exchange approval software. Currencies may be approved orunapproved based on considerations of reliability and/or stability, toname a few.

In a step S2408, the one or more computers may determine whetherqualified transaction data is available for the exchange for a thresholdaggregate period of time. Qualified transaction data may be data from areference period during which a threshold number of transactionsoccurred (e.g., at least 3 transactions) and/or a maximum volatilitythreshold was not exceeded (e.g., the high and low price during thereference period did not fluctuate by more than 50% compared to therespective average high and low prices during that reference period ofthe other top (e.g., top 4) potential qualified exchanges by volume). Inembodiments, transaction data may be evaluated from a plurality ofreference periods to determine whether the data satisfies qualificationcriteria. In embodiments, transaction data to be qualified must satisfyqualification criteria for at least a specified period of time, whichmay be sub-divided into reference periods. For example, qualifiedtransaction data may be determined for reference periods of 15 minutes,and to be a qualified exchange, the exchange must have qualifiedtransaction data for an aggregate of at least 10 hours (40 referenceperiods) over a 24-hour tracking period. In embodiments, if an exchangesatisfies each of the criteria examined in this exemplary process, itmay be considered a qualified exchange for the tracking period overwhich it was examined. The determination of qualified exchanges may beperformed at the end of each tracking period or on a rolling basis(e.g., re-evaluated at the end of each reference period).

Description of Electronic Data Pulled from Inputs

For each exchange on the approved list, the prior 24 hours of datasetting forth each trade on the exchange by execution price and quantitytransacted can be obtained, e.g., received and/or retrieved. Suchtransaction data may be obtained In embodiments, one or more digitalasset prices, such as, e.g., closing price, traded value, bid price, askprice, and/or spot price, to name a few, may be obtained. Inembodiments, only the highest and lowest exchange prices and theirrespective transaction volumes may be obtained. In embodiments, allexchange price and transaction data may be obtained. In embodiments, ashorter period of time than 24 hours may be used, e.g., 12 hours, 3hours, to name a few, or a longer period of time such as 48 hours may beused, to insure a sufficient volume of transaction data is considered.

Application of Electronic Data

For each of the exchanges included in the calculation for any givenevaluation day, an average price for such date can be used. Inembodiments, using each average exchange price for such date, a blendedand weighted average price for all exchanges can be extracted and usedas the blended digital asset price.

In embodiments, a blended digital asset price may be calculated by firstcalculating each selected exchange's daily average and then blending(e.g., averaging) the averages into a blended digital asset price. Thedaily average may be a time-weighted (e.g., exponential) moving meanand/or volume weighted mean. In other embodiments, a blended digitalasset price may be calculated using the data from the selected exchanges(e.g., the top 3 qualified exchanges) without first determining singleexchange averages.

Single Exchange Average

In embodiments, a single exchange averages may be used instead of ablended digital asset price. In other embodiments, single exchangeaverages may be combined into a blended digital asset price.

In embodiments, the single exchange average may be calculated by one ormore computers using the unweighted mean average of the high and lowtrading prices for such day (the average price of each trade during theday—which could be subject to manipulation through outlier pricetrades).

In embodiments, the single exchange average may be calculated by one ormore computers using the weighted mean average of the high and lowtrading prices for such day (e.g., the trading price for each sharetraded that day, rather than for each executed trade regardless of sharesize).

In embodiments, the single exchange average may be calculated by one ormore computers using the median average of the high and low tradingprices for such day.

In embodiments, the single exchange average may be calculated by one ormore computers using the weighted median average of the high and lowtrading prices for such day.

In embodiments the single exchange average may be calculated by one ormore computers using any of a median, weighted median, average, and/orweighted average (by volume, time, or otherwise), any of which may betaken of high and low trading prices for a time period (e.g., 1 day, 1hour, 15 minutes, to name a few), of the second highest and secondlowest trading prices for a time period, and/or of all trades during atime period. For example, all transaction price data for a time periodmay be weighted by the volume transacted at the prices and/or by time(e.g., linearly or exponentially) in order to give greater weight to themore recent price data. Coefficients or other factors may be used toadjust the weighting so as to dampen or exacerbate any pricefluctuations. For example, in embodiments, a coefficient for exponentialweighting may be 0.69. In other embodiments, such a coefficient may beapproximately 0.5, approximately 0.6, approximately 0.7, approximately0.8, approximately 0.9, to name a few. Accordingly, in embodiments, acoefficient of exponential weighting can fall with a range 0.5-0.9,within a range 0.6-0.8, or within a range 0.7-0.8, to name a few.

Blended Digital Asset Price

In embodiments, the blended digital asset price can be calculated by theaverage of the single exchange averages. In embodiments, the average maybe weighted by volume. An average may weight different exchangesdifferently in order to account for differences in ease of access offunds from an exchange and/or ease of transacting on the exchange. Asdescribed herein, a blended digital asset price may be calculated aspart of providing a generated digital asset index.

In embodiments, the blended digital asset price may be calculated asillustrated in FIG. 23A. In step S602, one or more computers may obtainthe highest and lowest digital asset prices for each sub-period of aprior time period for N approved exchanges available. In embodiments, Nmay be the 3 largest approved exchanges. In step S604, each of thesevalues may be averaged, using one or more computers, to determine ablended digital asset price for the prior sub-period. In embodiments,the blended digital asset price may be calculated for a 12-hour periodor for a 24-hour period. In embodiments, the blended digital asset pricemay be calculated using a mean average transaction price weighted byvolume.

FIG. 23B illustrates a process for calculating the blended digital assetprice using a 12-hour sub-period. In a step S606, one or more computersmay obtain the highest and lowest digital asset prices for each hour ofa prior 12-hour time period for a specified number N of the approvedexchanges available. In a step S608, each of the values may be averaged,using one or more computers, to determine a blended digital asset pricefor the 12-hour period.

FIG. 23C illustrates a process for calculating the blended digital assetprice using a 24-hour sub-period. In a step S610, one or more computersmay obtain the highest and lowest digital asset prices for each hour ofa prior 24-hour time period for a specified number N of the approvedexchanges available. In a step S612, each of the values may be averaged,using one or more computers, to determine a blended digital asset pricefor the 24-hour period.

FIG. 23D illustrates a process for calculating the blended digital assetprice using a 12-hour sub-period. In a step S614, one or more computersmay obtain the highest and lowest digital asset prices for each hour ofa prior 12-hour time period for the three largest of the approvedexchanges available. In a step S616, each of the values may be averaged,using one or more computers, to determine a blended digital asset pricefor the 12-hour period.

FIG. 23E illustrates another process for calculating a blended digitalasset price. In a step S620, one or more computers may determine one ormore reference exchanges. The reference exchanges may be the top N(e.g., 3) qualified exchanges by volume exchanged during a trackingperiod. A tracking period may be any period of time, such as 15 minutes,30 minutes, 1 hour, 6 hours, or 12 hours, to name a few. Referenceexchanges may be selected from a list of approved or qualified exchanges(e.g., approved by the sponsor). An exemplary process for approvingexchanges to determine qualified exchanges is described herein withrespect to FIG. 22. Reference exchanges may be determined each trackingperiod or may be determined over longer periods. For example, thereference exchanges may be determined at a fixed time each day. In astep S622, for each reference exchange, the one or more computers candetermine highest and lowest exchange prices, as well as thecorresponding volumes of digital assets exchanged at those high and lowprices during a reference period. In embodiments, the reference periodmay be a different amount of time than the tracking period during whichthe reference exchanges are determined. In a step S624, one or morecomputers may calculate a blended digital asset price by averaging thehigh and low prices from each reference exchange, weighted by therespective volume of digital assets traded at each high and low priceduring the reference period.

FIG. 23F illustrates another exemplary process for calculating a blendeddigital asset price. In a step S620, one or more reference exchanges maybe determined, as described with respect to FIG. 23E. In a step S622 a,for each reference exchange, the one or more computers can determinesecond highest and second lowest exchange prices, as well as thecorresponding volumes of digital assets exchanged at those secondhighest and second lowest prices during a reference period. In a stepS624, one or more computers may determine a weighted average of thedetermined second highest and second lowest prices from each referenceexchange, where the weighted average is weighted by volume exchanged ateach price, as discussed with respect to FIG. 23E.

FIG. 23G illustrates another exemplary process for calculating a blendeddigital asset price. In a step S620, one or more reference exchanges maybe determined, as described with respect to FIG. 23E. In a step S622 b,for each reference exchange, the one or more computers can determine amedian price and corresponding volumes of digital assets exchanged atthat price during a reference period. In a step S624, one or morecomputers may determine a volume weighted average of the determinedmedian prices from each reference exchange, as discussed with respect toFIG. 23E.

FIG. 23H illustrates another exemplary process for calculating a blendeddigital asset price. In a step S620, one or more reference exchanges maybe determined, as described with respect to FIG. 23E. In a step S622 c,for each reference exchange, the one or more computers can determineprices for all exchange transactions and corresponding volumes ofdigital assets exchanged at those prices during a reference period. In astep S624, one or more computers may determine a volume weighted averageof the determined exchange prices from the one or more referenceexchanges, as discussed with respect to FIG. 23E. In embodiments, thedigital asset prices from each reference period may be weighted by time,e.g., so as to preference more recent reference periods. Such weightingmay be exponential weighting, such as an exponentially time-weightedmoving average. Other moving averages may be employed, with or withoutweighting, such as a simple moving average, a cumulative moving average,a weighted moving average, and/or a volume weighted moving average, toname a few. Transaction data may be weighted by both volume and time,for example, by applying a volume weighted average as well as anexponential time-weighted moving average. Accordingly, an exponentialvolume-weighted moving average may be employed, applying an exponentialweighting to transaction volumes over shifting period of time (e.g., atrailing 2-hour window).

FIG. 24 illustrates an exemplary system for providing a digital assetindex in accordance with the present invention. A digital asset indexsystem may include one or more user devices 2005 (e.g., 2005-1 to2005-N), one or more digital asset kiosks 2010, one or more referencetransmitters 2015 (e.g., 2015-1 to 2015-R), a digital asset indexer2020, a digital asset index publisher 2025 (e.g., Winkdex, Bloomberg,Google, Yahoo, to name a few), one or more exchanges 2030, one or moreexchange agents 2035, and/or an exchange traded product computer system2040, to name a few. Any of the components involved in a digital assetindex system may be connected directly (e.g., through wired or wirelessconnections) or indirectly, such as through a data network 2002. Any ofthe components of a digital asset index system can comprise or include acomputer system comprising one or more computers. Accordingly, any ofthe components may have at least one or more processors,computer-readable memory, and communications portals for communicatingwith other components of the system and/or outside entities.

Still referring to FIG. 24, a user device 2005 may be a mobile phone,smart phone, PDA, computer, tablet computer, and/or other electronicdevice that can receive communications. A user device 2005 may runsoftware, such as a digital wallet, for accessing a digital asset indexor may access a digital asset index through a general Internet browser.A digital asset kiosk 2010 may also access a published digital assetindex, as discussed herein. A digital asset indexer 2020 may generateone or more digital asset indices, and a digital asset index publisher2025 may provide access to the one or more digital asset indices. Forexample, a digital asset index publisher 2025 may publish an index to awebsite, to a scrolling sign, and/or to software (e.g., an applicationsuch as a digital wallet client on a user device), to name a few. Adigital asset indexer 2025 may deliver index data (which may includeindex values and other information, such as times corresponding to thevalues) and/or one or more index values to one or more destinations,such as user devices 2005 and/or computer systems, including third-partycomputer systems. Delivering index data can include transmission via adata network 2002, which can include transmission by email and/or SMS,to name a few. An application programming interface (“API”) may be usedto provide access to a digital asset index from one or more third-partydevices or computer systems. An embeddable widget may be provided toenable display on a third-party website of digital asset index dataand/or index visualizations (e.g., graphs, charts, and/or accompanyingvisualization options, such as time range).

Still referring to FIG. 24, data from one or more reference transmitters2015 may be used to generate an index, as discussed herein. Transmittersmay be money service businesses or money transmit businesses in theUnited States. Transmitters 2015 may be part of a digital asset exchange2030. Exchanges 2030 outside the United States may function liketransmitters, e.g., performing all or part of the roles ascribed hereinto transmitters 2015, but without the same money transmit licenses asrequired in the United States.

FIG. 25A is another flow chart of an exemplary process for providing ablended digital math-based asset price in accordance with the presentinvention.

In a step S822, one or more computers may access from one or moreelectronic databases stored on computer-readable memory, electronicdigital math-based asset pricing data associated with a first period oftime for a digital math-based asset from a plurality of referencedigital math-based asset exchanges (e.g., four exchanges). Inembodiments, the electronic pricing data can include transaction pricesand/or bid and ask prices, to name a few. In embodiments, the one ormore computers may access transaction data, including transaction volumedata.

In a step S824, the one or more computers may determine a plurality ofqualified digital math-based asset exchanges (e.g., three exchanges)from the plurality of reference digital math-based asset exchanges. Inembodiments, the plurality of qualified exchanges may be determined byevaluating, by the one or more computers, electronic exchange selectioncriteria, which may comprise one or more electronic exchange selectionrules.

In a step S826, a blended digital math-based asset price for the firstperiod of time may be calculated, using the one or more computers, usinga volume weighted average of the electronic digital math-based assetpricing data from the plurality of qualified exchanges for the firstperiod of time.

In a step S828, the one or more computers may store in one or moredatabases the blended digital math-based asset price for the firstperiod of time. In embodiments, the databases may be remotely located,e.g., in a cloud computing architecture. In embodiments, the databasesmay store one or more other blended digital math-based asset pricescorresponding to one or more other periods of time.

In a step S830, the one or more computers may publish to one or moreother computers the blended digital math-based asset price for the firstperiod of time. As described herein, publishing can comprisetransmitting the price to one or more computer, transmitting the priceto one or more user electronic device (e.g., a mobile phone), providingthe price to an electronic display (e.g., a scrolling display), and/orproviding the price to a website, to name a few. In embodiments, theprice may be published from the database of blended digital math-basedasset prices. In other embodiments, the price may be published by thecalculating computer directly, e.g., from working memory.

FIG. 25B is a flow chart of another exemplary process for electronicallygenerating an index of digital asset prices.

In a step S842, a first plurality of constituent digital math-basedasset exchanges may be determined, using the one or more computers, fora first period of time (e.g., a 24-hour period). In embodiments,electronic digital math-based asset pricing data and associated volumedata may be obtained, at the one or more computers, for a first trackingperiod for each of a plurality of reference digital math-based assetexchanges. In embodiments, the total volume of transactions made on therespective exchange during the tracking period may be calculated, by theone or more computers, for each of the plurality of reference digitalmath-based asset exchanges. In embodiments, a first plurality ofconstituent digital math-based asset exchanges may be determined, by theone or more computers, by ranking the plurality of reference digitalmath-based asset exchanges by total volume for the tracking period andselecting a second plurality of the reference digital math-based assetexchanges (e.g., three) according to the largest total volumes, whereinthe second plurality is less than the first plurality.

In embodiments, the process for determining the first plurality ofconstituent digital math-based asset exchanges can further comprisedetermining, by the one or more computers, for each of the plurality ofreference digital math-based asset exchanges whether the total volume oftransactions made on the respective exchange during the tracking periodsatisfies a threshold volume; determining, by the one or more computers,whether the digital math-based asset exchange transacts in an approvedcurrency; and determining, by the one or more computers, for each of theplurality of reference digital math-based asset exchanges whetherqualified transaction data is available from the respective digitalmath-based asset exchange for a threshold aggregate period of time,wherein qualified transaction data is data from a calculation periodduring which (1) a threshold number of transactions occurred and (2) amaximum volatility threshold was not exceeded, and wherein a calculationperiod is a subperiod of the tracking period.

In a step S844, electronic digital math-based asset pricing data may beobtained, using the one or more computers, for each of the firstplurality of constituent digital math-based asset exchange for a firstsubperiod of the first period of time (e.g., a 2-hour period within thefirst period of time). In embodiments, electronic digital math-basedasset pricing data (e.g., transaction prices, bid and ask prices,transaction volume data, to name a few) may be obtained, using the oneor more computers, for each of the first plurality of constituentdigital math-based asset exchange for a second subperiod of the firstperiod of time.

In a step S846, a blended digital math-based asset price may bedetermined, using the one or more computers, for the first subperiod, bycalculating an exponential volume-weighted moving average of the digitalmath-based asset pricing data for each of the first plurality ofconstituent digital math-based asset exchange for the first subperiod.In embodiments, a blended digital math-based asset price may bedetermined, using the one or more computers, for the second subperiod,by calculating an exponential volume-weighted moving average of thedigital math-based asset pricing data for each of the first plurality ofconstituent digital math-based asset exchange for the second subperiod.In embodiments, the exponential moving average utilizes a coefficientbetween 0.6 and 0.8.

In a step S848, the blended digital math-based asset price may bestored, using the one or more computers, for the first subperiod in ablended price database stored on computer-readable memory operativelyconnected to the one or more computers. In embodiments, the blendeddigital math-based asset price may be stored, using the one or morecomputers, for the second subperiod in the blended price database. Inembodiments, the blended price database may comprise at least blendeddigital math-based asset prices at a specified interval, e.g., pricesevery 15 seconds, every minute, and/or once per day, such as at aspecified time each day, to name a few. Accordingly, prices at theintervals may be interpolated from the blended digital asset pricesclosest in time.

In a step S850, blended digital math-based asset price for the firstsubperiod may be published, by the one or more computers. Inembodiments, blended digital math-based asset prices may be published,by the one or more computers, for a plurality of consecutive subperiodsduring the first period of time. In embodiments, the blended digitalmath-based asset price for the first subperiod or for the plurality ofconsecutive subperiods may be published from the blended price database.In embodiments, the blended digital math-based asset price may bepublished to one or more user devices. In embodiments, the blendeddigital math-based asset price may be electronically published through adedicated website and/or through one or more electronic access points.The blended digital asset price can be published, using one or morecomputers, on the trust's website and distributed to APs. The blendeddigital asset price may form the basis of a digital asset index, asdiscussed herein. In embodiments, no intraday blended digital assetprice may be required to be published throughout the day.

Still referring to step S850, a graphical representation of blendeddigital math-based asset prices may be generated, by the one or morecomputers. The graphical representation may include the blended digitalmath-based asset prices for the plurality of consecutive subperiodsduring the second period of time. The graphical representation may beprovided from the one or more computers to the one or more secondcomputers. In embodiments, the graphical representation includes agraphical representation of the digital math-based asset pricing datafor each of the first plurality of constituent digital math-based assetexchanges for the plurality of consecutive subperiods during the secondperiod of time. In embodiments, the graphical representation furtherincludes a second graphical representation of volume data for each ofthe first plurality of constituent digital math-based asset exchangesfor the plurality of consecutive subperiods during the second period oftime.

In still other embodiments, an API for accessing the blended digitalmath-based asset price may be provided, by the one or more computers toone or more third computers. An electronic API request to access ablended digital math-based asset price for a subperiod may be received,by the one or more computers from the one or more third computers, andthe blended digital math-based asset price for the first subperiod maybe provided by the one or more computers to the one or more thirdcomputers.

In embodiments, generating a blended digital asset price and/or ablended digital asset price index can comprise accessing transactiondata from a plurality of exchanges, as described herein. Such processescan include data normalization, which can convert data to a consistentand/or uniform format. For example, digital asset price data from oneexchange may be provided in units of bitcoin, while price data fromanother exchange may be provided in units of milli-bitcoin, and datafrom another exchange may be provided in satoshis. Upon accessing thedata from the different exchanges, the data may be converted to a commonformat, such as milli-bitcoin. In embodiments, time data may also beconverted to a common format, e.g., 24-hour time, and/or a common timezone, e.g., GMT.

In an exemplary embodiment, a blended digital asset price may becalculated by blending the trading prices in U.S. dollars for the topthree (by volume) qualified exchanges during the previous two-hourperiod using a volume-weighted exponential moving average. Constituentexchanges of the index can be selected according to rules, such asrequiring that the exchanges have electronic trading platforms on whichusers may buy or sell digital assets with other users in exchange forU.S. dollars. The value of the index (including a daily spot price) canbe determined using exchange transaction data on a moving average basisover a trailing two-hour period. The computer code used to generate theindex may weight exchange transactions by volume on a proportionalbasis. In order to reflect the latest in pricing information, the mostrecent transactions may be weighted exponentially greater than earliertransactions in the two-hour period.

Example of ETP Process

Without meaning to limit the scope of the present invention, thefollowing examples illustrate exemplary embodiments in accordance withthe present invention and set forth the basic operation of the trust ona day-to-day basis by reflecting exemplary creations, redemptions,payments of the sponsor's fee, netting of transfers, trusteeinstructions and actions, and the creation and activation of coldstorage digital wallets from the cold storage vault security system.

Each of these examples assume the following facts:

-   -   There are two authorized participants (AP1 and AP2).    -   The Trust is comprised of 5,000,000 outstanding shares,        represented by underlying assets totaling 999,370.51327457        bitcoins. Assuming a blended bitcoin price of $200.00, the trust        NAV is $199,728,984.50 as of the open of business on Day 1. For        the purpose of this example, the blended bitcoin price does not        change.    -   Each creation unit is represented by 9,986.44922498 bitcoins.        While the trust will be formed at 10,000 bitcoins per 50,000        share creation units on the purchase of the seed baskets, the        operation of the trust and accumulation of accrued expenses will        reduce the bitcoins per creation unit rate over time.    -   Of the 10,000 cold storage digital wallets generated by the        trustee in the formation of the trust, the following is a        breakdown of their use status:        -   1,000 wallets are in use in cold storage, with 999 wallets            holding 1,000 bitcoins and one partially filled wallet            holding 370.51327457 bitcoins;        -   422 cold storage wallets have expired due to use for spot            checking or activation by recall of paper tokens; and        -   8579 wallets remain inactive in cold storage.    -   The partially filled cold storage digital wallets has index        number 02814 and holds 370.51327457 bitcoins.    -   The sponsor's fee is 1.00% per annum.

In the exemplary embodiments described in the following examples, thetrust operates by rounding only to the nearest Satoshi, which is onehundred-millionth of a bitcoin. As a result, transactions in bitcoinswill be reflected to eight decimal places. To assist in the orderlynetting and administration of the administrative portal and the coldstorage security system, a three business day settlement period is used.The sponsor's fee represents the trust's only expected regular charge.These examples do not include extraordinary expenses, meaning that thesponsor's fee will be the only expense accruing on a daily basis. Thiswill be reflected in the reduction of the bitcoins represented by acreation unit on each of the three days of the example.

Example 1

In Example 1, the following particular facts are assumed:

AP1 places a creation order for three creation unit. AP2 places aredemption order for one creation unit. No Sponsor's Fee orextraordinary expenses payable on settlement date. The trust compositionis: 5,000,000 outstanding Shares, representing 999,370.51327457bitcoins. bitcoins per creation unit: 9,986.44922498. Amount of bitcoinsin only partially-filled cold storage digital wallets (Index Number02814): 370.51327457.

On day T, AP1 and AP2 place their orders for three creation units andone redemption, respectively. Trustee accepts the creation andredemption orders and confirms such receipt to AP1 and AP2.

On day T+1, trustee calculates expected netting to be 1 creation unit(i.e., 3 creation units created less 1 creation unit redeemed; noexpected Sponsor's Fee or extraordinary expense payments). Trusteedetermines that no paper tokens need to be retrieved for withdrawals ordistributions of bitcoins on the settlement date. The trustee determinesand identifies 20 cold storage digital wallets from the IndexNumber-Public Key list for deposit activation for settlement datecreations.

On day T+2, AP1 submits a creation wallet address supplement identifyingthe public key from which AP1 can deposit its creation deposit of29,959.34767494 bitcoins. Using the administrative portal, trusteegenerates a wallet for the AP1 custody account and provides suchwallet's public key to AP1 to receive the creation deposit. AP2 submitsa redemption wallet address supplement identifying the public key towhich AP2 can receive its redemption proceeds of 9,986.44922498bitcoins. Using the administrative portal, trustee generates a walletfor the AP2 custody account and provides such wallet's public key to AP2as the account distributing bitcoins. AP1 delivers 29,959.34767494bitcoins to the public key identified for its AP1 custody account.Trustee acknowledges receipt of such creation deposit. AP2 delivers50,000 shares to the trust through the third-party clearing agency(e.g., DTC) clearance process. Trustee acknowledges receipt of suchshare tender.

On day T+3 (Settlement Date), for netting purposes and using theadministrative portal, trustee generates a wallet for the trust custodyaccount and transfers 9,986.44922498 bitcoins from the AP1 custodyaccount to such wallet in the trust custody account. Using theadministrative portal, the trustee transfers 9,986.44922498 bitcoinsfrom a trust custody account to the newly created wallet in the AP2custody account; transfers such bitcoins from the AP2 custody account towallet associated with the Public Key identified by AP2 as its outsideaccount; and instructs the third-party clearing agency (e.g., the DTC)to cancel the 50,000 shares tendered by AP2, in settlement of theredemption. Using the administrative portal, trustee transfers629.48672543 bitcoins from the AP1 custody account to partially-filledcold storage digital wallets (Index Number 02814) in cold storage;transfers 1,000 bitcoins each from AP1 custody account to 19 additionalnewly-activated cold storage digital wallets in cold storage; transfers343.41172453 bitcoins from AP1 custody account to the newly activatedcold storage digital wallets (Index Number 08649) in cold storage; andinstructs the third-party clearing agency (e.g., the DTC) to transfer150,000 newly issued shares to AP1 and to cancel the 50,000 sharestendered by AP2, in settlement of the creation.

At the end of this process, there is a net gain of 100,000 shares (2creation units) issued and 19,972.89844996 bitcoins deposited into thetrust; 20 cold storage digital wallets activated, no cold storagedigital wallets expired. All temporary wallets are discarded after use.Amount of bitcoins in only partially-filled cold storage digital wallets(Index Number 08649): 343.41172453.

Example 2

Example 2 is treated as the next business day after settlement ofExample 1. In Example 2, the following additional particular facts areassumed: AP1 places a creation order for two creation units. AP2 placesa redemption order for two creation units. Sponsor's Fee of 837.22012681bitcoins is due. The trustee can have calculated the sponsor's fee andthe sponsor can have confirmed this calculation and provided a PublicKey for its outside account prior to Day T. No extraordinary expensesare due payable on settlement date. The trust composition is: 5,100,000outstanding shares, representing 1,019,343.41172453 bitcoins. Thebitcoins per creation unit is: 9,985.35481959 (reduced because of fourdays of accrued but unpaid Sponsor's Fee). Amount of bitcoins in onlypartially-filled cold storage digital wallet (Index Number 08649):343.41172453.

On day T, AP1 and AP2 place their orders for two creation units and tworedemption units, respectively. Trustee accepts the creation andredemption orders and confirms such receipt to AP1 and AP2.

On day T+1, trustee calculates expected netting of 19,970.70963918(i.e., 2 creation units created less 2 creation units redeemed lessexpected sponsor's fee, with no expected extraordinary expensepayments). Trustee determines that one public key must be retrievedthrough paper tokens for sponsor's fee distributions on the settlementdate and requests that the custodian deliver the paper token for theselected Index Number (cold storage digital wallet 00185) from sets A1,A2 and A3. The Trustee determines that only partially-filled coldstorage digital wallet Index Number 08649 can be required for depositactivation for remainder bitcoins from the sponsor's fee distribution.

On day T+2, AP1 submits a creation wallet address supplement identifyingthe public key from which it can deposit its creation deposit of19,970.70963917 bitcoins. Using the administrative portal, trusteegenerates a wallet for the AP1 custody account and provides suchwallet's public key to AP1 to receive the creation deposit. AP2 submitsa redemption wallet address supplement identifying the public key towhich it can received its redemption proceeds of 19,970.70963917bitcoins. Using the administrative portal, trustee generates a walletfor the AP2 custody account and provides such wallet's public key to AP2as the account distributing bitcoins. Custodian delivers to trustee (ortrustee collects from custodian's premises) the paper tokens for theselected Index Number (cold storage digital wallet 00185) from sets A1,A2 and A3. Trustee scans the QR codes, decrypts and reassembles thePrivate key and decrypts the public key for cold storage digital wallet00185. AP1 delivers 19,970.70963917 bitcoins to the public keyidentified for its AP1 custody account. Trustee acknowledges receipt ofsuch creation deposit. AP2 delivers 50,000 shares to the trust throughthe third-party clearing agency 250 (e.g., the DTC) clearance process.Trustee acknowledges receipt of such share tender.

On day T+3, settlement occurs. For netting purposes and using theadministrative portal, Trustee generates a Wallet for the trust custodyaccount and transfers 19,970.70963917 bitcoins from the AP1 CustodyAccount to such Wallet in the trust custody account. Using theadministrative portal, the trustee transfers 19,970.70963917 bitcoinsfrom the trust custody account to the newly created wallet in the AP2custody account; transfers such bitcoins from the AP2 custody account towallet associated with the public key identified by AP2 as its outsideaccount; and instructs the third-party clearing agency (e.g., the DTC)to transfer 100,000 newly issued shares to AP1, in settlement of thecreation, and to cancel the 100,000 shares tendered by AP2, insettlement of the redemption. Using the administrative portal, trusteegenerates a wallet in the sponsor custody account and transfers837.22012681 bitcoins from Index Number cold storage digital wallets00185 to the newly created sponsor custody account wallet. Trustee alsotransfers such bitcoins from the sponsor custody account to the publickey identified by sponsor as its outside account; and transfers162.77987319 bitcoins from Index Number cold storage digital wallet00185 to the partially filled index number cold storage digital wallet08649 in cold storage.

At the end of this process, there is no net change of shares issued.bitcoins deposited with the Trust is reduced by 837.22012681. No newcold storage digital wallets activated by deposit; one cold storagedigital wallets expired after recall from cold storage and use. Alltemporary wallets discarded after use. Amount of bitcoins in onlypartially-filled cold storage digital wallet (Index Number 08649):506.19159772.

Example 3

Example 3 is treated as the next business day after settlement ofExample 2. In Example 3, the following additional particular facts areassumed: AP2 places a redemption order for four creation units. AP1 doesnot place any order. No Sponsor's Fee or extraordinary expenses payableon settlement date. The trust composition is: 5,100,000 outstandingshares, representing 1,018,506.19159772 bitcoins. bitcoins per creationunit is: 9,985.08121824 (reduced because of four days of accrued butunpaid Sponsor's Fee). Amount of bitcoins in only partially-filled coldstorage digital wallet (index Number 08649): 506.19159772.

On day T, AP2 place its redemption order for four creation units.Trustee accepts the redemption order and confirms such receipt to AP2.

On day T+1, trustee calculates expected netting (none). Trusteedetermines that 40 public keys need to be retrieved through paper tokensfor redemption distributions on the settlement date and requests thatthe custodian deliver the paper tokens for the selected Index Numbersfrom sets A1, A2 and A3. The trustee determines that onlypartially-filled cold storage digital wallets Index Number 08649 can berequired for deposit activation for remainder bitcoins from theredemption proceeds withdrawal.

On day T+2, AP submits “redemption wallet address supplement”identifying the public key to which it can received its redemptionproceeds of 39,940.32487295 bitcoins. Using the administrative portal,trustee generates a wallet for the AP2 custody account and provides suchwallet's public key to AP2 as the account distributing bitcoins.Custodian delivers to trustee (or trustee collects from custodian'spremises) the paper tokens for the selected 40 cold storage digitalwallets by Index Number from Sets A1, A2 and A3. Trustee scans the QRcodes, decrypts and reassembles the Private Keys and decrypts the PublicKeys for the 40 cold storage digital wallets by Index Number. AP2delivers 200,000 shares to the Trust through the third-party clearingagency (e.g., the DTC) clearance process. Trustee acknowledges receiptof such share tender.

On day T+3 (Settlement Date), using the administrative portal, thetrustee transfers 1,000 bitcoins from each of 39 of the cold storagedigital wallets pulled from cold storage to the newly created wallet inthe AP2 custody account, totaling 39,000 bitcoins; transfers940.32487295 bitcoins from the remaining cold storage digital walletpulled from cold storage to the newly created wallet in the AP2 custodyaccount; transfers 59.67512705 bitcoins from the remaining cold storagedigital wallet to partially-filled cold storage digital wallet (IndexNumber 08649); transfers the total of 39,940.32487295 such bitcoins fromthe wallet in AP2 custody account to the public key identified by AP2 asits outside account; and instructs the third-party clearing agency(e.g., the DTC) to cancel the 200,000 shares tendered by AP2, insettlement of the redemption.

At the end of this process, there is a reduction of 20,000 shares issuedby the trust and a reduction of 39,940.32487295 bitcoins deposited withthe trust. No new cold storage digital wallets activated by deposit;forty cold storage digital wallets expired after recall from coldstorage and use. All temporary wallets discarded after use. Amount ofbitcoins in only partially-filled cold storage digital wallet (IndexNumber 08649): 565.86672477.

Now that embodiments of the present invention have been shown anddescribed in detail, various modifications and improvements thereon canbecome readily apparent to those skilled in the art. Accordingly, theexemplary embodiments of the present invention, as set forth above, areintended to be illustrative, not limiting. The spirit and scope of thepresent invention is to be construed broadly.

What is claimed is:
 1. A trust computer system comprising: (1) one ormore processors; (2) non-transitory computer-readable memory operativelyconnected to the one or more processors, the non-transitorycomputer-readable memory having stored thereon machine-readableinstructions that, when executed by the one or more processors, causethe one or more processors to perform a method comprising: (a)determining, by the trust computer system comprising one or morecomputers, share price information based at least in part upon a firstquantity of digital math-based assets held by a trust at a first pointin time and a second quantity of shares in the trust at the first pointin time, the trust computer system being operatively connected to adecentralized digital asset network that uses a decentralized electronicledger in the form of a blockchain maintained by a plurality ofphysically remote computer systems to track at least one of assetownership or transactions in a digital math based asset system; (b)receiving, at the trust computer system from one or more authorizedparticipant user devices of an authorized participant, the one or moreauthorized participant user devices being operatively connected to thedecentralized digital asset network, an electronic request to redeem athird quantity of shares; (c) determining, by the trust computer system,a fourth quantity of digital math-based assets based at least in partupon the share price information and the third quantity of shares; (d)obtaining, by the trust computer system, one or more destination digitalasset account identifiers that provide access through the decentralizeddigital asset network to one or more destination digital asset accountsfor receipt by the authorized participant of a transfer of the fourthquantity of digital math-based assets from the trust; (e) obtaining, bythe trust computer system, one or more origin digital asset accountidentifiers that provide access through the decentralized digital assetnetwork to one or more origin digital asset accounts for the transfer;(f) initiating, by the trust computer system, the transfer of the fourthquantity of digital math-based assets from the one or more origindigital asset accounts as accessed through the decentralized digitalasset network using the one or more origin digital asset accountidentifiers to the one or more destination digital asset accounts asaccessed through the decentralized digital asset network using the oneor more destination digital asset account identifiers; (g) broadcasting,by the trust computer system, occurrence of the transfer to thedecentralized electronic ledger; (h) verifying, by the trust computersystem using the decentralized electronic ledger, a receipt of thefourth quantity of digital math-based assets at the one or moredestination digital asset accounts; and (i) canceling or causing to becanceled, by the trust computer system, the third quantity of sharesfrom the authorized participant.
 2. The trust computer system of claim1, wherein the method further comprises after step (a) the step of: (j)transmitting, from the trust computer system to the one or moreauthorized participant user devices, the share price information.
 3. Thetrust computer system of claim 1, wherein the determining step (c)further comprises the steps of: (j) obtaining, by the trust computersystem, a net asset value per share; (k) determining, by the trustcomputer system, a digital math-based asset value of the third quantityof shares based upon the net asset value per share; (l) determining, bythe trust computer system, transaction fees associated with theelectronic request; and (m) determining, by the trust computer system,the fourth quantity of digital math-based assets by subtracting thetransaction fees from the digital math-based asset value of the thirdquantity of shares.
 4. The trust computer system of claim 3, wherein thetransaction fees are denominated in a unit of the digital math-basedasset.
 5. The trust computer system of claim 1, wherein the share priceinformation comprises a net asset value per share.
 6. The trust computersystem of claim 1, wherein the share price information comprises anadjusted net asset value per share.
 7. The trust computer system ofclaim 1, wherein the share price information comprises a net asset valueper a basket of shares corresponding to a number of shares associatedwith one creation unit of shares.
 8. The trust computer system of claim7, wherein the basket of shares comprises one or more quantities ofshares selected from the group consisting of: 5,000 shares, 10,000shares, 15,000 shares, 25,000 shares, 50,000 shares, and 100,000 shares.9. The trust computer system of claim 1, wherein the electronic requestcomprises a redemption order.
 10. The trust computer system of claim 1,wherein the one or more origin digital asset accounts correspond to atrust custody account.
 11. The trust computer system of claim 1, whereinthe one or more destination digital asset accounts correspond to anauthorized participant custody account.
 12. The trust computer system ofclaim 1, wherein a trustee of the trust operates the trust computersystem.
 13. The trust computer system of claim 1, wherein anadministrator of the trust operates the trust computer system.
 14. Thetrust computer system of claim 1, wherein the method further comprisesbefore step (f) the step of: (j) determining, by the trust computersystem, a settlement period associated with the electronic request. 15.The trust computer system of claim 1, wherein the method furthercomprises before step (f) the steps of: (j) retrieving or causing to beretrieved, by the trust computer system, one or more private keysassociated with the one or more origin digital asset accounts; and (k)accessing the one or more origin digital asset accounts using at leastthe one or more private keys.
 16. The trust computer system of claim 15,wherein the step (j) further comprises the steps of: (l) issuing, by thetrust computer system, retrieval instructions for retrieving a pluralityof encrypted private keys corresponding to the one or more origindigital asset accounts; (m) receiving, at the trust computer system, theplurality of encrypted private keys; and (n) obtaining, by the trustcomputer system, one or more private keys by decrypting the plurality ofprivate keys.
 17. The trust computer system of claim 15, wherein thestep (j) further comprises the steps of: (l) issuing, by the trustcomputer system, retrieval instructions for retrieving a plurality ofprivate key segments corresponding to the one or more origin digitalasset accounts; (m) receiving, at the trust computer system, theplurality of private key segments; and (n) obtaining, by the trustcomputer system, one or more private keys by assembling the plurality ofprivate keys.
 18. The trust computer system of claim 15, wherein thestep (j) further comprises the steps of: (l) issuing, by the trustcomputer system, retrieval instructions for retrieving a plurality ofencrypted private key segments corresponding to the one or more origindigital asset accounts; (m) receiving, at the trust computer system, theplurality of encrypted private key segments; and (n) obtaining, by thetrust computer system, one or more private keys by decrypting theplurality of private key segments and assembling the segments into oneor more private keys.
 19. The trust computer system of claim 15, whereinthe step (j) further comprises the steps of: (l) issuing, by the trustcomputer system, retrieval instructions for retrieving a plurality ofencrypted private key segments corresponding to the one or more origindigital asset accounts; (m) receiving, at the trust computer system, theplurality of encrypted private key segments; (n) obtaining, by the trustcomputer system, one or more first private keys by decrypting theplurality of private key segments and assembling the segments into oneor more first private keys; and (o) obtaining, by the trust computersystem, at least one second private key corresponding to the one or moreorigin digital asset accounts.
 20. The trust computer system of claim19, wherein the one or more first private keys and the at least onesecond private key are keys for one or more multi-signature digitalasset accounts.
 21. The trust computer system of claim 1, wherein theverifying step (h), further comprises the steps of: (j) accessing, bythe trust computer system, a plurality of updates to the decentralizedelectronic ledger; (k) analyzing, by the trust computer system, each ofthe plurality of updates for a first confirmation, by a node in thedecentralized digital asset network, of the receipt of the fourthquantity of digital math-based assets at the one or more destinationdigital asset accounts; and (l) determining, by the trust computersystem, a final confirmation of the receipt after detecting firstconfirmations of the receipt in a predetermined number of the pluralityof updates to the decentralized electronic ledger.
 22. The trustcomputer system of claim 21, wherein the plurality of updates to thedecentralized electronic ledger comprise new blocks added to theblockchain.
 23. The trust computer system of claim 1, wherein thedecentralized digital asset network is governed by a cryptologicprotocol.
 24. The trust computer system of claim 1, wherein thedecentralized digital asset network is governed by an algorithmicprotocol.
 25. The trust computer system of claim 21, wherein the firstconfirmation by a node in the decentralized digital asset network isobtained by a proof of work at the node.
 26. The trust computer systemof claim 21, wherein the first confirmation by a node in thedecentralized digital asset network is obtained by a proof of stake atthe node.
 27. The trust computer system of claim 21, wherein the firstconfirmation by a node in the decentralized digital asset network isobtained by a proof of burn at the node.
 28. The trust computer systemof claim 1, wherein the blockchain is a bitcoin blockchain.